lazyset-0.1.0.0: Set and Map from lazy/infinite lists.

Copyright (c) Carlos Freund 2016 MIT carlosfreund@gmail.com experimental Safe Haskell2010

Data.Map.Lazier

Contents

Description

A Map that can be created from lazy, ordered, infinite lists. Based on LazySet.

Synopsis

# Types

type Map k e = LazySet (MapEntry k e) Source #

A mapping of type k to type e.

# Query

member :: Ord k => k -> Map k e -> Bool Source #

Check if a key exists in this Map.

lookup :: Ord k => k -> Map k e -> Maybe e Source #

Return the value of a given key or Nothing

# Creation

fromList :: Ord k => [(k, e)] -> Map k e Source #

Create a new Map from a list of tuples. The list must be sorted by key ascending.