join

join :: Monad m => m (m a) -> m a
base Control.Monad
The join function is the conventional monad join operator. It is used to remove one level of monadic structure, projecting its bound argument into the outer level.
package join
package
Parallel Join Patterns with Guards and Propagation Version 0.4
joinDrive :: FilePath -> FilePath -> FilePath
filepath System.FilePath.Windows, filepath System.FilePath.Posix
Join a drive and the rest of the path. > uncurry joinDrive (splitDrive x) == x > Windows: joinDrive "C:" "foo" == "C:foo" > Windows: joinDrive "C:\\" "bar" == "C:\\bar" > Windows: joinDrive "\\\\share" "foo" == "\\\\share\\foo" > Windows: joinDrive "/:" "foo" == "/:\\foo"
package joinlist
package
A JoinList - a list type with with cheap catenation. Generally speaking, joinlists have cheap construction (cons, snoc and join aka. append) and expensive manipulation. For most use-cases Data.Sequence is a more appropriate data structure. Changelog * 3.0 - Added views as per Data.Sequence and takes and drops. Changed show instance to mimic Data.Sequence. * 2.0 - more operations and some bugfixes (toList...), wrap renamed to singleton. Version 0.3.0
joinPath :: [FilePath] -> FilePath
filepath System.FilePath.Windows, filepath System.FilePath.Posix
Join path elements back together. > Valid x => joinPath (splitPath x) == x > joinPath [] == "" > Posix: joinPath ["test","file","path"] == "test/file/path"
joinProcessGroup :: ProcessGroupID -> IO ()
unix System.Posix.Process.ByteString, unix System.Posix.Process
joinProcessGroup pgid calls setpgid to set the ProcessGroupID of the current process to pgid.
joinRose :: Rose (Rose a) -> Rose a
QuickCheck Test.QuickCheck.Property
conjoin :: Testable prop => [prop] -> Property
QuickCheck Test.QuickCheck.Property, QuickCheck Test.QuickCheck
Take the conjunction of several properties.
disjoin :: Testable prop => [prop] -> Property
QuickCheck Test.QuickCheck.Property, QuickCheck Test.QuickCheck
Take the disjunction of several properties.
package disjoint-set
package
This is a persistent data structure for disjoint sets. The algorithm is described in "Introduction to Algorithms" by Cormen, et al. The implementation here uses both union by rank and path compression. We incur an O(logn) overhead because of the use of persistent maps. Data.IntDisjointSet is as strict as possible. Version 0.2
package disjoint-sets-st
package
Imperative ST/IO based disjoint set data structure. Version 0.1