monoid and fold rearranging

docs/Folds.md

@@ -160,3 +160,12 @@ notElem :: (Foldable t, Eq a) => a -> t a -> Bool
 ```haskell
 find :: Foldable t => (a -> Bool) -> t a -> Maybe a
 ```
+
+
+```haskell
+foldr1May :: (a -> a -> a) -> [a] -> Maybe a
+```
+
+```haskell
+foldl1May :: (a -> a -> a) -> [a] -> Maybe a
+```

docs/List.md

@@ -109,3 +109,14 @@ filter :: (a -> Bool) -> [a] -> [a]
 ```haskell
 replicate :: Int -> a -> [a]
 ```
+
+Indexing
+--------
+
+```haskell
+atMay :: [a] -> Int -> Maybe a
+```
+
+```haskell
+atDef :: a -> [a] -> Int -> a
+```

docs/Monoid.md

@@ -29,14 +29,20 @@ mconcat :: Monoid a => [a] -> a
 Semigroup
 ---------
 
+#### <>
+
 ```haskell
 (<>) :: Semigroup a => a -> a -> a
 ```
 
+#### sconcat
+
 ```haskell
 sconcat :: Semigroup a => NonEmpty a -> a
 ```
 
+#### stimes
+
 ```haskell
 stimes :: (Semigroup a, Integral b) => b -> a -> a
 ```

src/Protolude.hs

@@ -305,6 +305,7 @@ import Data.Function as X (
 -- Genericss
 import GHC.Generics as X (
     Generic(..)
+  , Generic1
   , Rep
   , K1(..)
   , M1(..)