| /dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/deque-0.4.3/library/Deque/Lazy/ |
| H A D | Defs.hs | 18 data Deque a = Deque ![a] ![a] function
35 take :: Int -> Deque a -> Deque a
54 drop :: Int -> Deque a -> Deque a
94 span :: (a -> Bool) -> Deque a -> (Deque a, Deque a)
115 shiftLeft :: Deque a -> Deque a
132 cons :: a -> Deque a -> Deque a
138 snoc :: a -> Deque a -> Deque a
163 prepend :: Deque a -> Deque a -> Deque a
172 reverse :: Deque a -> Deque a
192 tail :: Deque a -> Deque a
[all …]
|
| H A D | Reader.hs | 8 import Deque.Lazy (Deque)
9 import qualified Deque.Lazy as Deque
24 prepend :: MonadReader (Deque a) m => Deque a -> m (Deque a)
31 append :: MonadReader (Deque a) m => Deque a -> m (Deque a)
38 cons :: MonadReader (Deque a) m => a -> m (Deque a)
45 snoc :: MonadReader (Deque a) m => a -> m (Deque a)
52 reverse :: MonadReader (Deque a) m => m (Deque a)
59 shiftLeft :: MonadReader (Deque a) m => m (Deque a)
108 span :: MonadReader (Deque a) m => (a -> Bool) -> m (Deque a, Deque a)
161 tail :: MonadReader (Deque a) m => m (Deque a)
[all …]
|
| H A D | State.hs | 4 module Deque.Lazy.State module
8 import Deque.Lazy (Deque)
9 import qualified Deque.Lazy as Deque
24 prepend :: MonadState (Deque a) m => Deque a -> m ()
31 append :: MonadState (Deque a) m => Deque a -> m ()
108 span :: MonadState (Deque a) m => (a -> Bool) -> m (Deque a)
136 null = gets Deque.null
150 head = gets Deque.head
157 last = gets Deque.last
164 tail = modify Deque.tail
[all …]
|
| /dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/deque-0.4.3/library/Deque/Strict/ |
| H A D | Reader.hs | 8 import Deque.Strict (Deque)
9 import qualified Deque.Strict as Deque
24 prepend :: MonadReader (Deque a) m => Deque a -> m (Deque a)
31 append :: MonadReader (Deque a) m => Deque a -> m (Deque a)
38 cons :: MonadReader (Deque a) m => a -> m (Deque a)
45 snoc :: MonadReader (Deque a) m => a -> m (Deque a)
52 reverse :: MonadReader (Deque a) m => m (Deque a)
59 shiftLeft :: MonadReader (Deque a) m => m (Deque a)
108 span :: MonadReader (Deque a) m => (a -> Bool) -> m (Deque a, Deque a)
161 tail :: MonadReader (Deque a) m => m (Deque a)
[all …]
|
| H A D | Defs.hs | 29 cons :: a -> Deque a -> Deque a
35 snoc :: a -> Deque a -> Deque a
41 reverse :: Deque a -> Deque a
52 shiftLeft :: Deque a -> Deque a
63 shiftRight :: Deque a -> Deque a
79 take :: Int -> Deque a -> Deque a
98 drop :: Int -> Deque a -> Deque a
138 span :: (a -> Bool) -> Deque a -> (Deque a, Deque a)
154 uncons :: Deque a -> Maybe (a, Deque a)
200 tail :: Deque a -> Deque a
[all …]
|
| H A D | State.hs | 4 module Deque.Strict.State module
8 import Deque.Strict (Deque)
9 import qualified Deque.Strict as Deque
24 prepend :: MonadState (Deque a) m => Deque a -> m ()
31 append :: MonadState (Deque a) m => Deque a -> m ()
108 span :: MonadState (Deque a) m => (a -> Bool) -> m (Deque a)
136 null = gets Deque.null
150 head = gets Deque.head
157 last = gets Deque.last
164 tail = modify Deque.tail
[all …]
|
| /dports/net/ipsumdump/ipsumdump-1.86/libclick-2.1/include/click/ |
| H A D | deque.hh | 176 inline Deque(const Deque<T> &x);
178 inline Deque(Deque<T> &&x);
181 inline Deque<T> &operator=(const Deque<T> &x);
183 inline Deque<T> &operator=(Deque<T> &&x);
343 inline Deque<T>::Deque() { in Deque() function in Deque
354 inline Deque<T>::Deque(const Deque<T> &x) { in Deque() function in Deque
361 inline Deque<T>::Deque(Deque<T> &&x) { in Deque() function in Deque
617 inline void Deque<T>::swap(Deque<T> &x) { in swap()
623 inline Deque<T> &Deque<T>::operator=(const Deque<T> &x) { in operator =()
631 inline Deque<T> &Deque<T>::operator=(Deque<T> &&x) { in operator =()
[all …]
|
| /dports/devel/adabooch/bc-20160321/src/ |
| H A D | bc-containers-deques-dynamic.ads | 33 type Deque is new Abstract_Deque with private; type
39 function Null_Container return Deque;
41 procedure Clear (D : in out Deque);
44 procedure Append (D : in out Deque;
53 procedure Remove (D : in out Deque; From : Positive);
56 function Length (D : in Deque) return Natural;
59 function Is_Empty (D : in Deque) return Boolean;
62 function Front (D : in Deque) return Item;
65 function Back (D : in Deque) return Item;
83 function Chunk_Size (D : Deque) return Natural;
[all …]
|
| H A D | bc-containers-deques-bounded.ads | 31 type Deque is new Abstract_Deque with private; type
33 function Null_Container return Deque;
35 procedure Clear (D : in out Deque);
38 procedure Append (D : in out Deque;
47 procedure Remove (D : in out Deque; From : Positive);
50 function Available (D : in Deque) return Natural;
53 function Length (D : in Deque) return Natural;
56 function Is_Empty (D : in Deque) return Boolean;
59 function Front (D : in Deque) return Item;
62 function Back (D : in Deque) return Item;
[all …]
|
| H A D | bc-containers-deques-unmanaged.ads | 30 type Deque is new Abstract_Deque with private; type
34 function Null_Container return Deque;
36 procedure Clear (D : in out Deque);
39 procedure Append (D : in out Deque;
48 procedure Remove (D : in out Deque; From : Positive);
51 function Length (D : in Deque) return Natural;
54 function Is_Empty (D : in Deque) return Boolean;
57 function Front (D : in Deque) return Item;
60 function Back (D : in Deque) return Item;
67 function "=" (Left, Right : in Deque) return Boolean;
[all …]
|
| H A D | bc-containers-deques-unbounded.ads | 32 type Deque is new Abstract_Deque with private; type
36 function Null_Container return Deque;
38 procedure Clear (D : in out Deque);
41 procedure Append (D : in out Deque;
50 procedure Remove (D : in out Deque; From : Positive);
53 function Length (D : in Deque) return Natural;
56 function Is_Empty (D : in Deque) return Boolean;
59 function Front (D : in Deque) return Item;
62 function Back (D : in Deque) return Item;
69 function "=" (Left, Right : in Deque) return Boolean;
[all …]
|
| H A D | bc-containers-deques-dynamic.adb | 27 procedure Clear (D : in out Deque) is
32 procedure Append (D : in out Deque;
58 function Length (D : Deque) return Natural is
63 function Is_Empty (D : Deque) return Boolean is
68 function Front (D : Deque) return Item is
73 function Back (D : Deque) return Item is
83 function "=" (Left, Right : Deque) return Boolean is
99 function Chunk_Size (D : Deque) return Natural is
108 (For_The_Deque : Deque) return Iterator'Class is
122 function Null_Container return Deque is
[all …]
|
| H A D | bc-containers-deques-bounded.adb | 27 procedure Clear (D : in out Deque) is
32 procedure Append (D : in out Deque;
58 function Available (D : in Deque) return Natural is
63 function Length (D : Deque) return Natural is
68 function Is_Empty (D : Deque) return Boolean is
73 function Front (D : Deque) return Item is
78 function Back (D : Deque) return Item is
88 function "=" (Left, Right : Deque) return Boolean is
98 (For_The_Deque : Deque) return Iterator'Class is
112 function Null_Container return Deque is
[all …]
|
| /dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/lens-5.0.1/src/Control/Lens/Internal/ |
| H A D | Deque.hs | 20 ( Deque(..)
57 null :: Deque a -> Bool
65 singleton :: a -> Deque a
73 size :: Deque a -> Int
81 fromList :: [a] -> Deque a
101 instance Apply Deque where
111 instance Alt Deque where
117 instance Plus Deque where
133 instance Bind Deque where
189 instance Cons (Deque a) (Deque b) a b where
[all …]
|
| /dports/security/hs-cryptol/cryptol-2.11.0/_cabal_deps/lens-5.0.1/src/Control/Lens/Internal/ |
| H A D | Deque.hs | 20 ( Deque(..)
57 null :: Deque a -> Bool
65 singleton :: a -> Deque a
73 size :: Deque a -> Int
81 fromList :: [a] -> Deque a
101 instance Apply Deque where
111 instance Alt Deque where
117 instance Plus Deque where
133 instance Bind Deque where
189 instance Cons (Deque a) (Deque b) a b where
[all …]
|
| /dports/www/hs-DAV/DAV-1.3.4/_cabal_deps/lens-4.19.2/src/Control/Lens/Internal/ |
| H A D | Deque.hs | 20 ( Deque(..)
54 null :: Deque a -> Bool
62 singleton :: a -> Deque a
70 size :: Deque a -> Int
78 fromList :: [a] -> Deque a
98 instance Apply Deque where
108 instance Alt Deque where
114 instance Plus Deque where
130 instance Bind Deque where
186 instance Cons (Deque a) (Deque b) a b where
[all …]
|
| /dports/www/hs-postgrest/postgrest-8.0.0/_cabal_deps/lens-4.19.2/src/Control/Lens/Internal/ |
| H A D | Deque.hs | 20 ( Deque(..)
54 null :: Deque a -> Bool
62 singleton :: a -> Deque a
70 size :: Deque a -> Int
78 fromList :: [a] -> Deque a
98 instance Apply Deque where
108 instance Alt Deque where
114 instance Plus Deque where
130 instance Bind Deque where
186 instance Cons (Deque a) (Deque b) a b where
[all …]
|
| /dports/devel/hs-git-annex/git-annex-8.20210903/_cabal_deps/lens-4.19.1/src/Control/Lens/Internal/ |
| H A D | Deque.hs | 20 ( Deque(..)
54 null :: Deque a -> Bool
62 singleton :: a -> Deque a
70 size :: Deque a -> Int
78 fromList :: [a] -> Deque a
98 instance Apply Deque where
108 instance Alt Deque where
114 instance Plus Deque where
130 instance Bind Deque where
186 instance Cons (Deque a) (Deque b) a b where
[all …]
|
| /dports/multimedia/mlt6-qt5/mlt-6.26.1/src/mlt++/ |
| H A D | MltDeque.cpp | 24 Deque::Deque( ) in Deque() function in Deque
29 Deque::~Deque( ) in ~Deque()
34 int Deque::count( ) in count()
39 int Deque::push_back( void *item ) in push_back()
44 void *Deque::pop_back( ) in pop_back()
49 int Deque::push_front( void *item ) in push_front()
54 void *Deque::pop_front( ) in pop_front()
59 void *Deque::peek_back( ) in peek_back()
64 void *Deque::peek_front( ) in peek_front()
69 void *Deque::peek( int index ) in peek()
|
| /dports/multimedia/mlt6/mlt-6.26.1/src/mlt++/ |
| H A D | MltDeque.cpp | 24 Deque::Deque( ) in Deque() function in Deque
29 Deque::~Deque( ) in ~Deque()
34 int Deque::count( ) in count()
39 int Deque::push_back( void *item ) in push_back()
44 void *Deque::pop_back( ) in pop_back()
49 int Deque::push_front( void *item ) in push_front()
54 void *Deque::pop_front( ) in pop_front()
59 void *Deque::peek_back( ) in peek_back()
64 void *Deque::peek_front( ) in peek_front()
69 void *Deque::peek( int index ) in peek()
|
| /dports/multimedia/mlt7/mlt-7.0.1/src/mlt++/ |
| H A D | MltDeque.cpp | 24 Deque::Deque( ) in Deque() function in Deque
29 Deque::~Deque( ) in ~Deque()
34 int Deque::count( ) in count()
39 int Deque::push_back( void *item ) in push_back()
44 void *Deque::pop_back( ) in pop_back()
49 int Deque::push_front( void *item ) in push_front()
54 void *Deque::pop_front( ) in pop_front()
59 void *Deque::peek_back( ) in peek_back()
64 void *Deque::peek_front( ) in peek_front()
69 void *Deque::peek( int index ) in peek()
|
| /dports/multimedia/mlt7-qt5/mlt-7.0.1/src/mlt++/ |
| H A D | MltDeque.cpp | 24 Deque::Deque( ) in Deque() function in Deque
29 Deque::~Deque( ) in ~Deque()
34 int Deque::count( ) in count()
39 int Deque::push_back( void *item ) in push_back()
44 void *Deque::pop_back( ) in pop_back()
49 int Deque::push_front( void *item ) in push_front()
54 void *Deque::pop_front( ) in pop_front()
59 void *Deque::peek_back( ) in peek_back()
64 void *Deque::peek_front( ) in peek_front()
69 void *Deque::peek( int index ) in peek()
|
| /dports/multimedia/py-mlt6/mlt-6.26.1/src/mlt++/ |
| H A D | MltDeque.cpp | 24 Deque::Deque( ) in Deque() function in Deque
29 Deque::~Deque( ) in ~Deque()
34 int Deque::count( ) in count()
39 int Deque::push_back( void *item ) in push_back()
44 void *Deque::pop_back( ) in pop_back()
49 int Deque::push_front( void *item ) in push_front()
54 void *Deque::pop_front( ) in pop_front()
59 void *Deque::peek_back( ) in peek_back()
64 void *Deque::peek_front( ) in peek_front()
69 void *Deque::peek( int index ) in peek()
|
| /dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/deque-0.4.3/library/Deque/ |
| H A D | Strict.hs | 7 module Deque.Strict module
9 StrictDefs.Deque,
34 import Deque.Prelude
35 import qualified Deque.Lazy.Defs as LazyDefs
36 import qualified Deque.Strict.Defs as StrictDefs
39 fromLazy :: LazyDefs.Deque a -> StrictDefs.Deque a
40 fromLazy (LazyDefs.Deque consList snocList) = StrictDefs.Deque (fromList consList) (fromList snocLi…
43 toLazy :: StrictDefs.Deque a -> LazyDefs.Deque a
44 toLazy (StrictDefs.Deque consList snocList) = LazyDefs.Deque (toList consList) (toList snocList)
|
| H A D | Lazy.hs | 7 module Deque.Lazy module
9 LazyDefs.Deque,
34 import Deque.Prelude
35 import qualified Deque.Lazy.Defs as LazyDefs
36 import qualified Deque.Strict.Defs as StrictDefs
39 fromStrict :: StrictDefs.Deque a -> LazyDefs.Deque a
40 fromStrict (StrictDefs.Deque consList snocList) = LazyDefs.Deque (toList consList) (toList snocList)
43 toStrict :: LazyDefs.Deque a -> StrictDefs.Deque a
44 toStrict (LazyDefs.Deque consList snocList) = StrictDefs.Deque (fromList consList) (fromList snocLi…
|