Improve general readability #69
					 2 changed files with 5 additions and 6 deletions
				
			
		|  | @ -12,15 +12,14 @@ import           Control.Concurrent | ||||||
| import           Control.Concurrent.Async | import           Control.Concurrent.Async | ||||||
| import           Control.Concurrent.STM | import           Control.Concurrent.STM | ||||||
| import           Control.Exception         (Exception (..), try) | import           Control.Exception         (Exception (..), try) | ||||||
| import           Control.Monad             (foldM, forM, forM_, forever, void, | import           Control.Monad             (foldM, forM_, forever, void, when) | ||||||
|                                             when) |  | ||||||
| import           Control.Monad.IO.Class    (liftIO) | import           Control.Monad.IO.Class    (liftIO) | ||||||
| import           Data.Bifunctor | import           Data.Bifunctor | ||||||
| import qualified Data.ByteString.Lazy.UTF8 as BSUL | import qualified Data.ByteString.Lazy.UTF8 as BSUL | ||||||
| import qualified Data.ByteString.UTF8      as BSU | import qualified Data.ByteString.UTF8      as BSU | ||||||
| import qualified Data.HashMap.Strict       as HMap | import qualified Data.HashMap.Strict       as HMap | ||||||
| import qualified Data.HashSet              as HSet | import qualified Data.HashSet              as HSet | ||||||
| import           Data.Maybe                (fromMaybe, isJust) | import           Data.Maybe                (isJust) | ||||||
| import           Data.String               (fromString) | import           Data.String               (fromString) | ||||||
| import qualified Data.Text.Lazy            as Txt | import qualified Data.Text.Lazy            as Txt | ||||||
| import           Data.Text.Normalize       (NormalizationMode (NFC), normalize) | import           Data.Text.Normalize       (NormalizationMode (NFC), normalize) | ||||||
|  |  | ||||||
|  | @ -23,7 +23,7 @@ instance (Bounded k, Ord k, Eq a) => Eq (RingMap k a) where | ||||||
|     a == b = getRingMap a == getRingMap b |     a == b = getRingMap a == getRingMap b | ||||||
| 
 | 
 | ||||||
| instance (Bounded k, Ord k, Show k, Show a) => Show (RingMap k a) where | instance (Bounded k, Ord k, Show k, Show a) => Show (RingMap k a) where | ||||||
|     show rmap = shows "RingMap " (show $ getRingMap rmap) |     show rmap = shows ("RingMap " :: String) (show $ getRingMap rmap) | ||||||
| 
 | 
 | ||||||
| -- | entry of a 'RingMap' that holds a value and can also | -- | entry of a 'RingMap' that holds a value and can also | ||||||
| -- wrap around the lookup direction at the edges of the name space. | -- wrap around the lookup direction at the edges of the name space. | ||||||
|  | @ -207,7 +207,7 @@ takeEntriesUntil_ :: (Integral i, Bounded k, Ord k) | ||||||
|                  -> Maybe i     -- possible number limit |                  -> Maybe i     -- possible number limit | ||||||
|                  -> [a] |                  -> [a] | ||||||
|                  -> [a] |                  -> [a] | ||||||
| takeEntriesUntil_ rmap' getterFunc' havingReached previousEntry (Just remaining) takeAcc | takeEntriesUntil_ _rmap' _getterFunc' _havingReached _previousEntry (Just remaining) takeAcc | ||||||
|   -- length limit reached |   -- length limit reached | ||||||
|   | remaining <= 0 = takeAcc |   | remaining <= 0 = takeAcc | ||||||
| takeEntriesUntil_ rmap' getterFunc' havingReached previousEntry numLimit takeAcc = | takeEntriesUntil_ rmap' getterFunc' havingReached previousEntry numLimit takeAcc = | ||||||
|  |  | ||||||
		Loading…
	
	Add table
		Add a link
		
	
		Reference in a new issue