|
|
|
|
Synopsis |
|
|
|
Documentation |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
:: Commute p | | => p -> Bool | predicate; if true we would like the patch in the left list
| -> FL p | input FL
| -> FL p :> FL p | left and right results
| split an FL into left and right lists according to a predicate, using commutation as necessary.
If a patch does satisfy the predicate but cannot be commuted past one that does not satisfy
the predicate, it goes in the right list.
|
|
|
|
:: Commute p | | => p -> Bool | predicate; if true we would like the patch in the right list
| -> RL p | input RL
| -> RL p :> RL p | left and right results
| split an RL into left and right lists according to a predicate, using commutation as necessary.
If a patch does satisfy the predicate but cannot be commuted past one that does not satisfy
the predicate, it goes in the left list.
|
|
|
|
|
|
|
|
|
|
|
|
|
Produced by Haddock version 2.4.2 |