| /dports/net-im/matterhorn/matterhorn-50200.13.0/_cabal_deps/brick-0.62/src/Data/ |
| H A D | IMap.hs | 4 module Data.IMap
5 ( IMap
95 insert :: Int -> Run a -> IMap a -> IMap a
101 delete :: Int -> Run ignored -> IMap a -> IMap a
113 restrict :: Int -> Run ignored -> IMap a -> IMap a
128 splitLE :: Int -> IMap a -> (IMap a, IMap a)
144 addToKeys :: Int -> IMap a -> IMap a
150 intersectionWith :: (a -> b -> c) -> IMap a -> IMap b -> IMap c
151 intersectionWith f (IMap runsa) (IMap runsb)
169 mapMaybe :: (a -> Maybe b) -> IMap a -> IMap b
[all …]
|
| /dports/finance/hs-hledger-ui/hledger-ui-1.19/_cabal_deps/brick-0.62/src/Data/ |
| H A D | IMap.hs | 4 module Data.IMap
5 ( IMap
95 insert :: Int -> Run a -> IMap a -> IMap a
101 delete :: Int -> Run ignored -> IMap a -> IMap a
113 restrict :: Int -> Run ignored -> IMap a -> IMap a
128 splitLE :: Int -> IMap a -> (IMap a, IMap a)
144 addToKeys :: Int -> IMap a -> IMap a
150 intersectionWith :: (a -> b -> c) -> IMap a -> IMap b -> IMap c
151 intersectionWith f (IMap runsa) (IMap runsb)
169 mapMaybe :: (a -> Maybe b) -> IMap a -> IMap b
[all …]
|
| /dports/devel/hs-git-brunch/git-brunch-1.5.1.0/_cabal_deps/brick-0.62/src/Data/ |
| H A D | IMap.hs | 4 module Data.IMap
5 ( IMap
95 insert :: Int -> Run a -> IMap a -> IMap a
101 delete :: Int -> Run ignored -> IMap a -> IMap a
113 restrict :: Int -> Run ignored -> IMap a -> IMap a
128 splitLE :: Int -> IMap a -> (IMap a, IMap a)
144 addToKeys :: Int -> IMap a -> IMap a
150 intersectionWith :: (a -> b -> c) -> IMap a -> IMap b -> IMap c
151 intersectionWith f (IMap runsa) (IMap runsb)
169 mapMaybe :: (a -> Maybe b) -> IMap a -> IMap b
[all …]
|
| /dports/misc/hs-hascard/hascard-0.3.0.1/_cabal_deps/brick-0.55/src/Data/ |
| H A D | IMap.hs | 4 module Data.IMap
5 ( IMap
95 insert :: Int -> Run a -> IMap a -> IMap a
101 delete :: Int -> Run ignored -> IMap a -> IMap a
113 restrict :: Int -> Run ignored -> IMap a -> IMap a
128 splitLE :: Int -> IMap a -> (IMap a, IMap a)
144 addToKeys :: Int -> IMap a -> IMap a
150 intersectionWith :: (a -> b -> c) -> IMap a -> IMap b -> IMap c
151 intersectionWith f (IMap runsa) (IMap runsb)
169 mapMaybe :: (a -> Maybe b) -> IMap a -> IMap b
[all …]
|
| /dports/net-im/matterhorn/matterhorn-50200.13.0/_cabal_deps/brick-0.62/tests/ |
| H A D | Main.hs | 9 import Data.IMap (IMap, Run(Run))
12 import qualified Data.IMap as IMap
20 instance Arbitrary v => Arbitrary (IMap v) where
21 arbitrary = IMap.fromList <$> arbitrary
26 lower :: IMap v -> IntMap v
29 | (base, Run n v) <- IMap.unsafeToAscList m
33 raise :: Eq v => IntMap v -> IMap v
43 lowerRun k r = IntMap.fromAscList [(k+offset, IMap.val r) | offset <- [0..IMap.len r-1]]
46 type I = IMap Ordering
65 prop_applicativeComposition :: IMap (O -> O) -> IMap (O -> O) -> IMap O -> Bool
[all …]
|
| /dports/finance/hs-hledger-ui/hledger-ui-1.19/_cabal_deps/brick-0.62/tests/ |
| H A D | Main.hs | 9 import Data.IMap (IMap, Run(Run))
12 import qualified Data.IMap as IMap
20 instance Arbitrary v => Arbitrary (IMap v) where
21 arbitrary = IMap.fromList <$> arbitrary
26 lower :: IMap v -> IntMap v
29 | (base, Run n v) <- IMap.unsafeToAscList m
33 raise :: Eq v => IntMap v -> IMap v
43 lowerRun k r = IntMap.fromAscList [(k+offset, IMap.val r) | offset <- [0..IMap.len r-1]]
46 type I = IMap Ordering
65 prop_applicativeComposition :: IMap (O -> O) -> IMap (O -> O) -> IMap O -> Bool
[all …]
|
| /dports/devel/hs-git-brunch/git-brunch-1.5.1.0/_cabal_deps/brick-0.62/tests/ |
| H A D | Main.hs | 9 import Data.IMap (IMap, Run(Run))
12 import qualified Data.IMap as IMap
20 instance Arbitrary v => Arbitrary (IMap v) where
21 arbitrary = IMap.fromList <$> arbitrary
26 lower :: IMap v -> IntMap v
29 | (base, Run n v) <- IMap.unsafeToAscList m
33 raise :: Eq v => IntMap v -> IMap v
43 lowerRun k r = IntMap.fromAscList [(k+offset, IMap.val r) | offset <- [0..IMap.len r-1]]
46 type I = IMap Ordering
65 prop_applicativeComposition :: IMap (O -> O) -> IMap (O -> O) -> IMap O -> Bool
[all …]
|
| /dports/misc/hs-hascard/hascard-0.3.0.1/_cabal_deps/brick-0.55/tests/ |
| H A D | Main.hs | 9 import Data.IMap (IMap, Run(Run))
12 import qualified Data.IMap as IMap
20 instance Arbitrary v => Arbitrary (IMap v) where
21 arbitrary = IMap.fromList <$> arbitrary
26 lower :: IMap v -> IntMap v
29 | (base, Run n v) <- IMap.unsafeToAscList m
33 raise :: Eq v => IntMap v -> IMap v
43 lowerRun k r = IntMap.fromAscList [(k+offset, IMap.val r) | offset <- [0..IMap.len r-1]]
46 type I = IMap Ordering
65 prop_applicativeComposition :: IMap (O -> O) -> IMap (O -> O) -> IMap O -> Bool
[all …]
|
| /dports/lang/mono/mono-5.10.1.57/mcs/class/referencesource/mscorlib/system/runtime/interopservices/windowsruntime/ |
| H A D | maptodictionaryadapter.cs | 44 IMap<K, V> _this = JitHelpers.UnsafeCast<IMap<K, V>>(this); in Indexer_Get()
57 IMap<K, V> _this = JitHelpers.UnsafeCast<IMap<K, V>>(this); in Indexer_Set()
65 IMap<K, V> _this = JitHelpers.UnsafeCast<IMap<K, V>>(this); in Keys()
74 IMap<K, V> _this = JitHelpers.UnsafeCast<IMap<K, V>>(this); in Values()
87 IMap<K, V> _this = JitHelpers.UnsafeCast<IMap<K, V>>(this); in ContainsKey()
103 IMap<K, V> _this = JitHelpers.UnsafeCast<IMap<K, V>>(this); in Add()
114 IMap<K, V> _this = JitHelpers.UnsafeCast<IMap<K, V>>(this); in Remove()
140 IMap<K, V> _this = JitHelpers.UnsafeCast<IMap<K, V>>(this); in TryGetValue()
161 private static V Lookup<K, V>(IMap<K, V> _this, K key) in Lookup()
178 private static bool Insert<K, V>(IMap<K, V> _this, K key, V value) in Insert()
|
| /dports/astro/qmapshack/qmapshack-V_1.16.1/src/qmapshack/map/ |
| H A D | IMap.cpp | 26 IMap::IMap(quint32 features, CMapDraw* parent) in IMap() function in IMap
33 IMap::~IMap() in ~IMap()
38 void IMap::saveConfig(QSettings& cfg) /* override */ in saveConfig()
62 void IMap::loadConfig(QSettings& cfg) /* override */ in loadConfig()
75 IMapProp* IMap::getSetup() in getSetup()
86 void IMap::convertRad2M(QPointF& p) const in convertRad2M()
91 void IMap::convertM2Rad(QPointF& p) const in convertM2Rad()
97 bool IMap::findPolylineCloseBy(const QPointF&, const QPointF&, qint32, QPolygonF&) in findPolylineCloseBy()
102 void IMap::drawTile(const QImage& img, QPolygonF& l, QPainter& p) in drawTile()
|
| /dports/math/hs-Agda/Agda-2.6.2/_cabal_deps/regex-tdfa-1.3.1.0/lib/Text/Regex/TDFA/ |
| H A D | TDFA.hs | 72 … , trans_single = indexesToDFA (IMap.keys (IMap.delete startIndex dtrans))
77 where hasSpawn = maybe False IMap.null (IMap.lookup startIndex dtrans)
101 makeWinner | noWin w = IMap.empty
109 dtrans =IMap.fromDistinctAscList . mapSnd (IMap.singleton source) $ best
129 where dtrans = IMap.unionWith IMap.union dt1 dt2
136 fuse :: [(IMap.Key, Transition)]
310 let ts = o : IMap.elems mt
319 onlySpawns t = case IMap.elems t of
320 [m] -> IMap.null m
328 in Instructions { newPos = IMap.toList p
[all …]
|
| /dports/lang/purescript/purescript-0.14.5/_cabal_deps/regex-tdfa-1.3.1.1/lib/Text/Regex/TDFA/ |
| H A D | TDFA.hs | 72 … , trans_single = indexesToDFA (IMap.keys (IMap.delete startIndex dtrans))
77 where hasSpawn = maybe False IMap.null (IMap.lookup startIndex dtrans)
101 makeWinner | noWin w = IMap.empty
109 dtrans =IMap.fromDistinctAscList . mapSnd (IMap.singleton source) $ best
129 where dtrans = IMap.unionWith IMap.union dt1 dt2
136 fuse :: [(IMap.Key, Transition)]
310 let ts = o : IMap.elems mt
319 onlySpawns t = case IMap.elems t of
320 [m] -> IMap.null m
328 in Instructions { newPos = IMap.toList p
[all …]
|
| /dports/games/hedgewars-server/hedgewars-src-1.0.0/gameServer/_cabal_deps/regex-tdfa-1.3.1.0/lib/Text/Regex/TDFA/ |
| H A D | TDFA.hs | 72 … , trans_single = indexesToDFA (IMap.keys (IMap.delete startIndex dtrans))
77 where hasSpawn = maybe False IMap.null (IMap.lookup startIndex dtrans)
101 makeWinner | noWin w = IMap.empty
109 dtrans =IMap.fromDistinctAscList . mapSnd (IMap.singleton source) $ best
129 where dtrans = IMap.unionWith IMap.union dt1 dt2
136 fuse :: [(IMap.Key, Transition)]
310 let ts = o : IMap.elems mt
319 onlySpawns t = case IMap.elems t of
320 [m] -> IMap.null m
328 in Instructions { newPos = IMap.toList p
[all …]
|
| /dports/finance/hs-hledger/hledger-1.19/_cabal_deps/regex-tdfa-1.3.1.0/lib/Text/Regex/TDFA/ |
| H A D | TDFA.hs | 72 … , trans_single = indexesToDFA (IMap.keys (IMap.delete startIndex dtrans))
77 where hasSpawn = maybe False IMap.null (IMap.lookup startIndex dtrans)
101 makeWinner | noWin w = IMap.empty
109 dtrans =IMap.fromDistinctAscList . mapSnd (IMap.singleton source) $ best
129 where dtrans = IMap.unionWith IMap.union dt1 dt2
136 fuse :: [(IMap.Key, Transition)]
310 let ts = o : IMap.elems mt
319 onlySpawns t = case IMap.elems t of
320 [m] -> IMap.null m
328 in Instructions { newPos = IMap.toList p
[all …]
|
| /dports/finance/hs-hledger-ui/hledger-ui-1.19/_cabal_deps/regex-tdfa-1.3.1.1/lib/Text/Regex/TDFA/ |
| H A D | TDFA.hs | 72 … , trans_single = indexesToDFA (IMap.keys (IMap.delete startIndex dtrans))
77 where hasSpawn = maybe False IMap.null (IMap.lookup startIndex dtrans)
101 makeWinner | noWin w = IMap.empty
109 dtrans =IMap.fromDistinctAscList . mapSnd (IMap.singleton source) $ best
129 where dtrans = IMap.unionWith IMap.union dt1 dt2
136 fuse :: [(IMap.Key, Transition)]
310 let ts = o : IMap.elems mt
319 onlySpawns t = case IMap.elems t of
320 [m] -> IMap.null m
328 in Instructions { newPos = IMap.toList p
[all …]
|
| /dports/finance/hs-hledger-web/hledger-web-1.19/_cabal_deps/regex-tdfa-1.3.1.0/lib/Text/Regex/TDFA/ |
| H A D | TDFA.hs | 72 … , trans_single = indexesToDFA (IMap.keys (IMap.delete startIndex dtrans))
77 where hasSpawn = maybe False IMap.null (IMap.lookup startIndex dtrans)
101 makeWinner | noWin w = IMap.empty
109 dtrans =IMap.fromDistinctAscList . mapSnd (IMap.singleton source) $ best
129 where dtrans = IMap.unionWith IMap.union dt1 dt2
136 fuse :: [(IMap.Key, Transition)]
310 let ts = o : IMap.elems mt
319 onlySpawns t = case IMap.elems t of
320 [m] -> IMap.null m
328 in Instructions { newPos = IMap.toList p
[all …]
|
| /dports/devel/hs-git-annex/git-annex-8.20210903/_cabal_deps/regex-tdfa-1.3.1.0/lib/Text/Regex/TDFA/ |
| H A D | TDFA.hs | 72 … , trans_single = indexesToDFA (IMap.keys (IMap.delete startIndex dtrans))
77 where hasSpawn = maybe False IMap.null (IMap.lookup startIndex dtrans)
101 makeWinner | noWin w = IMap.empty
109 dtrans =IMap.fromDistinctAscList . mapSnd (IMap.singleton source) $ best
129 where dtrans = IMap.unionWith IMap.union dt1 dt2
136 fuse :: [(IMap.Key, Transition)]
310 let ts = o : IMap.elems mt
319 onlySpawns t = case IMap.elems t of
320 [m] -> IMap.null m
328 in Instructions { newPos = IMap.toList p
[all …]
|
| /dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/regex-tdfa-1.3.1.0/lib/Text/Regex/TDFA/ |
| H A D | TDFA.hs | 72 … , trans_single = indexesToDFA (IMap.keys (IMap.delete startIndex dtrans))
77 where hasSpawn = maybe False IMap.null (IMap.lookup startIndex dtrans)
101 makeWinner | noWin w = IMap.empty
109 dtrans =IMap.fromDistinctAscList . mapSnd (IMap.singleton source) $ best
129 where dtrans = IMap.unionWith IMap.union dt1 dt2
136 fuse :: [(IMap.Key, Transition)]
310 let ts = o : IMap.elems mt
319 onlySpawns t = case IMap.elems t of
320 [m] -> IMap.null m
328 in Instructions { newPos = IMap.toList p
[all …]
|
| /dports/devel/hs-darcs/darcs-2.16.4/_cabal_deps/regex-tdfa-1.3.1.1/lib/Text/Regex/TDFA/ |
| H A D | TDFA.hs | 72 … , trans_single = indexesToDFA (IMap.keys (IMap.delete startIndex dtrans))
77 where hasSpawn = maybe False IMap.null (IMap.lookup startIndex dtrans)
101 makeWinner | noWin w = IMap.empty
109 dtrans =IMap.fromDistinctAscList . mapSnd (IMap.singleton source) $ best
129 where dtrans = IMap.unionWith IMap.union dt1 dt2
136 fuse :: [(IMap.Key, Transition)]
310 let ts = o : IMap.elems mt
319 onlySpawns t = case IMap.elems t of
320 [m] -> IMap.null m
328 in Instructions { newPos = IMap.toList p
[all …]
|
| /dports/www/hs-postgrest/postgrest-8.0.0/_cabal_deps/regex-tdfa-1.3.1.1/lib/Text/Regex/TDFA/ |
| H A D | TDFA.hs | 72 … , trans_single = indexesToDFA (IMap.keys (IMap.delete startIndex dtrans))
77 where hasSpawn = maybe False IMap.null (IMap.lookup startIndex dtrans)
101 makeWinner | noWin w = IMap.empty
109 dtrans =IMap.fromDistinctAscList . mapSnd (IMap.singleton source) $ best
129 where dtrans = IMap.unionWith IMap.union dt1 dt2
136 fuse :: [(IMap.Key, Transition)]
310 let ts = o : IMap.elems mt
319 onlySpawns t = case IMap.elems t of
320 [m] -> IMap.null m
328 in Instructions { newPos = IMap.toList p
[all …]
|
| /dports/devel/hs-ghcprofview/ghcprofview-0.1.0.1/_cabal_deps/regex-tdfa-1.3.1.0/lib/Text/Regex/TDFA/ |
| H A D | TDFA.hs | 72 … , trans_single = indexesToDFA (IMap.keys (IMap.delete startIndex dtrans))
77 where hasSpawn = maybe False IMap.null (IMap.lookup startIndex dtrans)
101 makeWinner | noWin w = IMap.empty
109 dtrans =IMap.fromDistinctAscList . mapSnd (IMap.singleton source) $ best
129 where dtrans = IMap.unionWith IMap.union dt1 dt2
136 fuse :: [(IMap.Key, Transition)]
310 let ts = o : IMap.elems mt
319 onlySpawns t = case IMap.elems t of
320 [m] -> IMap.null m
328 in Instructions { newPos = IMap.toList p
[all …]
|
| /dports/devel/hs-ShellCheck/ShellCheck-0.8.0/_cabal_deps/regex-tdfa-1.3.1.1/lib/Text/Regex/TDFA/ |
| H A D | TDFA.hs | 72 … , trans_single = indexesToDFA (IMap.keys (IMap.delete startIndex dtrans))
77 where hasSpawn = maybe False IMap.null (IMap.lookup startIndex dtrans)
101 makeWinner | noWin w = IMap.empty
109 dtrans =IMap.fromDistinctAscList . mapSnd (IMap.singleton source) $ best
129 where dtrans = IMap.unionWith IMap.union dt1 dt2
136 fuse :: [(IMap.Key, Transition)]
310 let ts = o : IMap.elems mt
319 onlySpawns t = case IMap.elems t of
320 [m] -> IMap.null m
328 in Instructions { newPos = IMap.toList p
[all …]
|
| /dports/deskutils/ical/ical-tcl/types/ |
| H A D | testmap.C | 44 #define HTABLE IMap
71 static int subset(IMap& m1, IMap& m2) { in subset()
93 static int compare(IMap& m1, IMap& m2) { in compare()
100 static void copy(IMap& m1, IMap& m2) { in copy()
203 IMap empty; in black_empty()
276 IMap single; in black_single()
305 IMap temp; in black_single()
334 IMap temp; in black_single()
355 IMap temp; in black_single()
608 IMap map; in black_multiple()
[all …]
|
| H A D | testomap.C | 27 static int subset(IMap& m1, IMap& m2) {
42 static int compare(IMap& m1, IMap& m2) { in compare()
49 static void copy(IMap& m1, IMap& m2) { in copy()
139 IMap empty; in black_empty()
210 IMap single; in black_single()
239 IMap temp; in black_single()
268 IMap temp; in black_single()
289 IMap temp; in black_single()
428 IMap temp; in black_multiple()
461 IMap temp; in black_multiple()
[all …]
|
| /dports/net-im/matterhorn/matterhorn-50200.13.0/_cabal_deps/brick-0.62/src/Brick/ |
| H A D | BorderMap.hs | 22 import Data.IMap (IMap, Run(Run))
26 import qualified Data.IMap as IM
49 , _values :: Edges (IMap a)
85 values :: BorderMap a -> Edges (IMap a)
101 :: Edges (Location -> Run a -> Int -> (Int, Int) -> IMap a -> IMap a)
106 insertPar, insertPerp :: Location -> Run a -> Int -> (Int, Int) -> IMap a -> IMap a
125 lookupRow :: Int -> BorderMap a -> IMap a
135 lookupCol :: Int -> BorderMap a -> IMap a
146 lookupH :: Location -> Run ignored -> BorderMap a -> IMap a
152 lookupV :: Location -> Run ignored -> BorderMap a -> IMap a
|