-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | A faster way to navigate directories using the command line.
--   
@package fcd
@version 1.0.0.0

module Fcd

-- | Main entry point for the program
run :: IO ()

-- | Compute the length of the longest common subsequence of two lists.
--   This is a simple implementation with memoization that uses quadratic
--   space (O(n*m) where n and m are the length of the inputs). Note: a
--   possible optimization would be to cache the memoized matrix as a lot
--   of it is still relevant when a new character is added.
lcs :: Eq a => [a] -> [a] -> Int
sortCandidates :: Eq a => [[a]] -> [a] -> [[a]]
instance Eq Command
instance Show Command