diff --git a/docs/reference/alteration.md b/docs/reference/alteration.md
index 2078d53b2..8ba635374 100644
--- a/docs/reference/alteration.md
+++ b/docs/reference/alteration.md
@@ -130,6 +130,20 @@ Here is an example of it being used conditionally:
 d1 $ every 3 (ply 4) $ s "bd ~ sn cp"
 ```
 
+### spaceOut
+
+```haskell
+spaceOut :: [Time] -> Pattern a -> Pattern a
+```
+
+`spaceOut xs p` repeats a Pattern p at different durations given by the list of time values in xs.
+
+```haskell
+d1 $ spaceOut [2, 1, (1/2)] $ s "kurt:2 ul:7"
+```
+
+...will effectively play the pattern in twice the time, normally and then at half the duration over three cycles.
+
 ### stutter
 ```haskell
 Type: stutter :: Integral i => i -> Time -> Pattern a -> Pattern a
@@ -209,6 +223,37 @@ d1 $ slow 2 $ sound "arpy:0 arpy:1 arpy:2 arpy:3 arpy:3 arpy:2 arpy:1 arpy:0"
 d1 $ every 2 rev $ sound "arpy:0 arpy:1 arpy:2 arpy:3"
 ```
 
+### snowball
+
+```haskell
+snowball :: Int -> (Pattern a -> Pattern a -> Pattern a) -> (Pattern a -> Pattern a) -> Pattern a -> Pattern a
+```
+
+snowball takes a function that can combine patterns (like +), a function that transforms a pattern (like slow), a depth, and a starting pattern, it will then transform the pattern and combine it with the last transformation until the depth is reached. This is like putting an effect (like a filter) in the feedback of a delay line; each echo is more affected.
+
+```haskell
+d1 $ note (
+  scale "hexDorian"
+  $ snowball 8 (+) (slow 2 . rev) "0 ~ . -1 _ 5 3 4 . ~ -2"
+)
+  # s "gtr"
+```
+
+### soak
+
+```haskell
+Type: soak :: Int -> (Pattern a -> Pattern a) -> Pattern a -> Pattern a
+```
+
+Applies a function to a pattern and cats the resulting pattern, then continues applying the function until the depth is reached. This can be used to create a pattern that wanders away from the original pattern by continually adding random numbers.
+
+```haskell
+d1
+$ soak 12 (fast 1.2) $ s "[808hc, bd sd/2]"
+```
+
+This will speed up your pattern by 1.2 on each cycle 12 times and then start from the beginning.
+
 ## Truncation
 ### trunc
 
@@ -296,11 +341,23 @@ d1 $ chunk 4 (hurry 2) $ sound "bd sn:2 [~ bd] sn:2"
 d1 $ loopFirst $ s "<<bd*4 ht*8> cp*4>"
 ```
 
+
 This function combines with sometimes to insert events from the first cycle randomly into subsequent cycles of the pattern:
+
+###timeLoop
+
 ```haskell
-d1 $ sometimes loopFirst $ s "<<bd*4 ht*8> cp*4>"
+timeLoop :: Pattern Time -> Pattern a -> Pattern a
 ```
 
+`timeLoop t` is like applying a modulo `t` to your sequence of cycles. So:
+
+```haskell
+d1 $ timeLoop 7 $ s "<bd sn cp hh>"
+```
+
+...is equivalent to: `d1 $ s "<bd sn cp hh bd sn cp>"`
+
 ## Shuffling and scrambling
 
 ### bite
@@ -324,6 +381,18 @@ The slices bits of pattern will be squeezed or contracted to fit:
 d1 $ bite 4 "2 [0 3] 1*4 1" $ n "0 .. 7" # sound "arpy"
 ```
 
+### permstep
+
+```haskell
+permstep :: RealFrac b => Int -> [a] -> Pattern b -> Pattern a 
+```
+
+Steps through permutations of a list, partitioned by the input pattern.
+
+```haskell
+d1 $ permstep 8 [0,1,2,3,4] (slow "[1|2]" $ range 0 1 tri) # s "arpy"
+```
+
 ### shuffle
 
 ```haskell
diff --git a/docs/reference/conditions.md b/docs/reference/conditions.md
index d381ff7ae..7077194a7 100644
--- a/docs/reference/conditions.md
+++ b/docs/reference/conditions.md
@@ -314,6 +314,18 @@ d1 $ struct (every 3 inv "t(3,8)") $ sound "cp"
 
 In the above, the euclidean pattern creates `"t f t f t f f t"` which gets inverted to `"f t f t f t t f"` every third cycle. Note that if you prefer you can use `1` and `0` instead of `t` and `f`.
 
+### substruct
+
+```haskell
+substruct :: Pattern Bool -> Pattern b -> Pattern b 
+```
+
+`substruct a b` is similar to `struct`, but each event in pattern `a` gets replaced with pattern `b`, compressed to fit the timespan of the event.
+
+```haskell
+d1 $ substruct (ascii "<T C>") $ s "bd sd"
+```
+
 ### mask
 
 ```haskell
diff --git a/docs/reference/time.md b/docs/reference/time.md
index 4fb7b4709..ed48656f3 100644
--- a/docs/reference/time.md
+++ b/docs/reference/time.md
@@ -395,6 +395,14 @@ d1 $ weaveWith 3 (sound "bd [sn drum:2*2] bd*2 [sn drum:1]")
   ]
 ```
 
+### tabby
+
+```haskell
+tabby :: Int -> Pattern a -> Pattern a -> Pattern a 
+```
+
+A more literal weaving than the weave function. Given `tabby threads p1 p`, parameters representing the threads per cycle and the patterns to weave, and this function will weave them together using a plain (aka 'tabby') weave, with a simple over/under structure
+
 ## Reversing time
 ### rev