From 005aaf2e1c94e749ccb4811d8406129e0a13f227 Mon Sep 17 00:00:00 2001 From: Andrew Kent Date: Mon, 18 Nov 2019 08:21:47 -0800 Subject: [PATCH] Haddock: specify insertion order means LIFO --- Data/Map/Ordered.hs | 4 ++-- Data/Set/Ordered.hs | 4 ++-- 2 files changed, 4 insertions(+), 4 deletions(-) diff --git a/Data/Map/Ordered.hs b/Data/Map/Ordered.hs index c950401..87b8f6b 100644 --- a/Data/Map/Ordered.hs +++ b/Data/Map/Ordered.hs @@ -4,8 +4,8 @@ {-# LANGUAGE FlexibleInstances #-} -- | An 'OMap' behaves much like a 'M.Map', with mostly the same asymptotics, but --- also remembers the order that keys were inserted. All operations whose --- asymptotics are worse than 'M.Map' have documentation saying so. +-- also remembers the order that keys were inserted (i.e., last in, first out). All +-- operations whose asymptotics are worse than 'M.Map' have documentation saying so. module Data.Map.Ordered ( OMap -- * Trivial maps diff --git a/Data/Set/Ordered.hs b/Data/Set/Ordered.hs index 633c620..1155505 100644 --- a/Data/Set/Ordered.hs +++ b/Data/Set/Ordered.hs @@ -3,8 +3,8 @@ {-# LANGUAGE FlexibleInstances #-} -- | An 'OSet' behaves much like a 'Set', with mostly the same asymptotics, but --- also remembers the order that values were inserted. All operations whose --- asymptotics are worse than 'Set' have documentation saying so. +-- also remembers the order that values were inserted (i.e., last in, first out). +-- All operations whose asymptotics are worse than 'Set' have documentation saying so. module Data.Set.Ordered ( OSet -- * Trivial sets