/dports/net-p2p/eiskaltdcpp-cli/eiskaltdcpp-2.2.10/eiskaltdcpp-gtk/src/ |
H A D | settingsmanager.cc | 47 defaultInt.insert(IntMap::value_type("tab-position", 0)); in WulforSettingsManager() 48 defaultInt.insert(IntMap::value_type("toolbar-style", 5)); in WulforSettingsManager() 49 defaultInt.insert(IntMap::value_type("sound-pm-open", 0)); in WulforSettingsManager() 50 defaultInt.insert(IntMap::value_type("sound-pm", 1)); in WulforSettingsManager() 121 defaultInt.insert(IntMap::value_type("open-queue", 0)); in WulforSettingsManager() 132 defaultInt.insert(IntMap::value_type("bold-pm", 0)); in WulforSettingsManager() 133 defaultInt.insert(IntMap::value_type("bold-queue", 0)); in WulforSettingsManager() 134 defaultInt.insert(IntMap::value_type("bold-hub", 0)); in WulforSettingsManager() 141 defaultInt.insert(IntMap::value_type("urlhandler", 0)); in WulforSettingsManager() 364 IntMap::iterator iit; in load() [all …]
|
/dports/net-p2p/eiskaltdcpp-gtk/eiskaltdcpp-2.2.10/eiskaltdcpp-gtk/src/ |
H A D | settingsmanager.cc | 47 defaultInt.insert(IntMap::value_type("tab-position", 0)); in WulforSettingsManager() 48 defaultInt.insert(IntMap::value_type("toolbar-style", 5)); in WulforSettingsManager() 49 defaultInt.insert(IntMap::value_type("sound-pm-open", 0)); in WulforSettingsManager() 50 defaultInt.insert(IntMap::value_type("sound-pm", 1)); in WulforSettingsManager() 121 defaultInt.insert(IntMap::value_type("open-queue", 0)); in WulforSettingsManager() 132 defaultInt.insert(IntMap::value_type("bold-pm", 0)); in WulforSettingsManager() 133 defaultInt.insert(IntMap::value_type("bold-queue", 0)); in WulforSettingsManager() 134 defaultInt.insert(IntMap::value_type("bold-hub", 0)); in WulforSettingsManager() 141 defaultInt.insert(IntMap::value_type("urlhandler", 0)); in WulforSettingsManager() 364 IntMap::iterator iit; in load() [all …]
|
/dports/net-p2p/eiskaltdcpp-lib/eiskaltdcpp-2.2.10/eiskaltdcpp-gtk/src/ |
H A D | settingsmanager.cc | 47 defaultInt.insert(IntMap::value_type("tab-position", 0)); in WulforSettingsManager() 48 defaultInt.insert(IntMap::value_type("toolbar-style", 5)); in WulforSettingsManager() 49 defaultInt.insert(IntMap::value_type("sound-pm-open", 0)); in WulforSettingsManager() 50 defaultInt.insert(IntMap::value_type("sound-pm", 1)); in WulforSettingsManager() 121 defaultInt.insert(IntMap::value_type("open-queue", 0)); in WulforSettingsManager() 132 defaultInt.insert(IntMap::value_type("bold-pm", 0)); in WulforSettingsManager() 133 defaultInt.insert(IntMap::value_type("bold-queue", 0)); in WulforSettingsManager() 134 defaultInt.insert(IntMap::value_type("bold-hub", 0)); in WulforSettingsManager() 141 defaultInt.insert(IntMap::value_type("urlhandler", 0)); in WulforSettingsManager() 364 IntMap::iterator iit; in load() [all …]
|
/dports/net-p2p/eiskaltdcpp-data/eiskaltdcpp-2.2.10/eiskaltdcpp-gtk/src/ |
H A D | settingsmanager.cc | 47 defaultInt.insert(IntMap::value_type("tab-position", 0)); in WulforSettingsManager() 48 defaultInt.insert(IntMap::value_type("toolbar-style", 5)); in WulforSettingsManager() 49 defaultInt.insert(IntMap::value_type("sound-pm-open", 0)); in WulforSettingsManager() 50 defaultInt.insert(IntMap::value_type("sound-pm", 1)); in WulforSettingsManager() 121 defaultInt.insert(IntMap::value_type("open-queue", 0)); in WulforSettingsManager() 132 defaultInt.insert(IntMap::value_type("bold-pm", 0)); in WulforSettingsManager() 133 defaultInt.insert(IntMap::value_type("bold-queue", 0)); in WulforSettingsManager() 134 defaultInt.insert(IntMap::value_type("bold-hub", 0)); in WulforSettingsManager() 141 defaultInt.insert(IntMap::value_type("urlhandler", 0)); in WulforSettingsManager() 364 IntMap::iterator iit; in load() [all …]
|
/dports/net-p2p/eiskaltdcpp-daemon/eiskaltdcpp-2.2.10/eiskaltdcpp-gtk/src/ |
H A D | settingsmanager.cc | 47 defaultInt.insert(IntMap::value_type("tab-position", 0)); in WulforSettingsManager() 48 defaultInt.insert(IntMap::value_type("toolbar-style", 5)); in WulforSettingsManager() 49 defaultInt.insert(IntMap::value_type("sound-pm-open", 0)); in WulforSettingsManager() 50 defaultInt.insert(IntMap::value_type("sound-pm", 1)); in WulforSettingsManager() 121 defaultInt.insert(IntMap::value_type("open-queue", 0)); in WulforSettingsManager() 132 defaultInt.insert(IntMap::value_type("bold-pm", 0)); in WulforSettingsManager() 133 defaultInt.insert(IntMap::value_type("bold-queue", 0)); in WulforSettingsManager() 134 defaultInt.insert(IntMap::value_type("bold-hub", 0)); in WulforSettingsManager() 141 defaultInt.insert(IntMap::value_type("urlhandler", 0)); in WulforSettingsManager() 364 IntMap::iterator iit; in load() [all …]
|
/dports/lang/ghc/ghc-8.10.7/libraries/containers/containers-tests/src/Data/IntMap/Strict/ |
H A D | Internal.hs | 404 insert :: Key -> a -> IntMap a -> IntMap a 662 unionWith :: (a -> a -> a) -> IntMap a -> IntMap a -> IntMap a 671 unionWithKey :: (Key -> a -> a -> a) -> IntMap a -> IntMap a -> IntMap a 685 differenceWith :: (a -> b -> Maybe a) -> IntMap a -> IntMap b -> IntMap a 710 intersectionWith :: (a -> b -> c) -> IntMap a -> IntMap b -> IntMap c 719 intersectionWithKey :: (Key -> a -> b -> c) -> IntMap a -> IntMap b -> IntMap c 763 mergeWithKey :: (Key -> a -> b -> Maybe c) -> (IntMap a -> IntMap c) -> (IntMap b -> IntMap c) 764 -> IntMap a -> IntMap b -> IntMap c 832 map :: (a -> b) -> IntMap a -> IntMap b 1024 mapEither :: (a -> Either b c) -> IntMap a -> (IntMap b, IntMap c) [all …]
|
/dports/lang/ghc/ghc-8.10.7/libraries/containers/containers/src/Data/IntMap/Strict/ |
H A D | Internal.hs | 404 insert :: Key -> a -> IntMap a -> IntMap a 662 unionWith :: (a -> a -> a) -> IntMap a -> IntMap a -> IntMap a 671 unionWithKey :: (Key -> a -> a -> a) -> IntMap a -> IntMap a -> IntMap a 685 differenceWith :: (a -> b -> Maybe a) -> IntMap a -> IntMap b -> IntMap a 710 intersectionWith :: (a -> b -> c) -> IntMap a -> IntMap b -> IntMap c 719 intersectionWithKey :: (Key -> a -> b -> c) -> IntMap a -> IntMap b -> IntMap c 763 mergeWithKey :: (Key -> a -> b -> Maybe c) -> (IntMap a -> IntMap c) -> (IntMap b -> IntMap c) 764 -> IntMap a -> IntMap b -> IntMap c 832 map :: (a -> b) -> IntMap a -> IntMap b 1024 mapEither :: (a -> Either b c) -> IntMap a -> (IntMap b, IntMap c) [all …]
|
/dports/lang/elm/compiler-0.19.1/_cabal_deps/containers-0.5.11.0/Data/IntMap/ |
H A D | Strict.hs | 378 insert :: Key -> a -> IntMap a -> IntMap a 636 unionWith :: (a -> a -> a) -> IntMap a -> IntMap a -> IntMap a 645 unionWithKey :: (Key -> a -> a -> a) -> IntMap a -> IntMap a -> IntMap a 659 differenceWith :: (a -> b -> Maybe a) -> IntMap a -> IntMap b -> IntMap a 684 intersectionWith :: (a -> b -> c) -> IntMap a -> IntMap b -> IntMap c 693 intersectionWithKey :: (Key -> a -> b -> c) -> IntMap a -> IntMap b -> IntMap c 737 mergeWithKey :: (Key -> a -> b -> Maybe c) -> (IntMap a -> IntMap c) -> (IntMap b -> IntMap c) 738 -> IntMap a -> IntMap b -> IntMap c 806 map :: (a -> b) -> IntMap a -> IntMap b 971 mapEither :: (a -> Either b c) -> IntMap a -> (IntMap b, IntMap c) [all …]
|
H A D | Internal.hs | 409 (\\) :: IntMap a -> IntMap b -> IntMap a 1025 union :: IntMap a -> IntMap a -> IntMap a 1053 difference :: IntMap a -> IntMap b -> IntMap a 1120 :: IntSetPrefix -> IntMap a -> (IntMap a -> IntMap a) -> IntMap a 1154 intersection :: IntMap a -> IntMap b -> IntMap a 1284 -> IntMap a -> IntMap b -> IntMap c 1303 … -> (IntMap a -> IntMap b -> IntMap c) -> (IntMap a -> IntMap c) -> (IntMap b -> IntMap c) 1304 -> IntMap a -> IntMap b -> IntMap c 2538 partition :: (a -> Bool) -> IntMap a -> (IntMap a,IntMap a) 2630 split :: Key -> IntMap a -> (IntMap a, IntMap a) [all …]
|
/dports/devel/poco/poco-1.10.1-all/Foundation/testsuite/src/ |
H A D | HashMapTest.cpp | 36 typedef HashMap<int, int> IntMap; in testInsert() typedef 37 IntMap hm; in testInsert() 43 std::pair<IntMap::Iterator, bool> res = hm.insert(IntMap::ValueType(i, i*2)); in testInsert() 47 IntMap::Iterator it = hm.find(i); in testInsert() 67 std::pair<IntMap::Iterator, bool> res = hm.insert(IntMap::ValueType(i, 0)); in testInsert() 79 typedef HashMap<int, int> IntMap; in testErase() typedef 80 IntMap hm; in testErase() 129 IntMap hm; in testIterator() 155 IntMap hm; in testConstIterator() 178 IntMap hm; in testIndex() [all …]
|
H A D | ListMapTest.cpp | 36 typedef ListMap<int, int> IntMap; in testInsert() typedef 37 IntMap hm; in testInsert() 43 IntMap::Iterator res = hm.insert(IntMap::ValueType(i, i*2)); in testInsert() 46 IntMap::Iterator it = hm.find(i); in testInsert() 57 IntMap::Iterator it = hm.find(i); in testInsert() 66 IntMap::Iterator res = hm.insert(IntMap::ValueType(i, 0)); in testInsert() 113 IntMap hm; in testErase() 162 IntMap hm; in testIterator() 188 IntMap hm; in testConstIterator() 211 IntMap hm; in testIntIndex() [all …]
|
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/src/Algebra/Graph/ |
H A D | AdjacencyIntMap.hs | 50 import Data.IntMap.Strict (IntMap) 58 import qualified Data.IntMap.Strict as IntMap 214 . IntMap.fromAscList 229 empty = AM IntMap.empty 297 [ x, y, IntMap.fromSet (const $ IntMap.keysSet y) (IntMap.keysSet x) ] 382 isEmpty = IntMap.null . adjacencyIntMap 671 removeVertex x = AM . IntMap.map (IntSet.delete x) . IntMap.delete x . adjacencyIntMap 724 combine v es = IntMap.unionWith IntSet.union (IntMap.fromSet (const $ IntSet.singleton v) es) 725 vs = IntMap.fromSet (const IntSet.empty) (IntMap.keysSet m) 754 gmap f = AM . IntMap.map (IntSet.map f) . IntMap.mapKeysWith IntSet.union f . adjacencyIntMap [all …]
|
/dports/lang/ghc/ghc-8.10.7/libraries/containers/containers-tests/src/Data/IntMap/ |
H A D | Internal.hs | 424 (\\) :: IntMap a -> IntMap b -> IntMap a 792 compose :: IntMap c -> IntMap Int -> IntMap c 1103 union :: IntMap a -> IntMap a -> IntMap a 1131 difference :: IntMap a -> IntMap b -> IntMap a 1198 :: IntSetPrefix -> IntMap a -> (IntMap a -> IntMap a) -> IntMap a 1232 intersection :: IntMap a -> IntMap b -> IntMap a 1362 -> IntMap a -> IntMap b -> IntMap c 1381 … -> (IntMap a -> IntMap b -> IntMap c) -> (IntMap a -> IntMap c) -> (IntMap b -> IntMap c) 1382 -> IntMap a -> IntMap b -> IntMap c 2736 split :: Key -> IntMap a -> (IntMap a, IntMap a) [all …]
|
/dports/lang/ghc/ghc-8.10.7/libraries/containers/containers/src/Data/IntMap/ |
H A D | Internal.hs | 424 (\\) :: IntMap a -> IntMap b -> IntMap a 792 compose :: IntMap c -> IntMap Int -> IntMap c 1103 union :: IntMap a -> IntMap a -> IntMap a 1131 difference :: IntMap a -> IntMap b -> IntMap a 1198 :: IntSetPrefix -> IntMap a -> (IntMap a -> IntMap a) -> IntMap a 1232 intersection :: IntMap a -> IntMap b -> IntMap a 1362 -> IntMap a -> IntMap b -> IntMap c 1381 … -> (IntMap a -> IntMap b -> IntMap c) -> (IntMap a -> IntMap c) -> (IntMap b -> IntMap c) 1382 -> IntMap a -> IntMap b -> IntMap c 2736 split :: Key -> IntMap a -> (IntMap a, IntMap a) [all …]
|
/dports/www/hs-postgrest/postgrest-8.0.0/_cabal_deps/optics-core-0.3.0.1/src/Data/IntMap/ |
H A D | Optics.hs | 38 module Data.IntMap.Optics 46 import Data.IntMap as IntMap 71 => Optic' k is s a -> s -> IntMap a 72 toMapOf o = ifoldMapOf o IntMap.singleton 83 lt :: Int -> IxAffineTraversal' Int (IntMap v) v 87 Just (k', v) -> f k' v <&> \v' -> IntMap.insert k' v' s 98 gt :: Int -> IxAffineTraversal' Int (IntMap v) v 102 Just (k', v) -> f k' v <&> \v' -> IntMap.insert k' v' s 113 le :: Int -> IxAffineTraversal' Int (IntMap v) v 117 Just (k', v) -> f k' v <&> \v' -> IntMap.insert k' v' s [all …]
|
/dports/lang/ghc/ghc-8.10.7/libraries/containers/containers-tests/benchmarks/ |
H A D | IntMap.hs | 8 import qualified Data.IntMap as M 60 ins :: [(Int, Int)] -> M.IntMap Int -> M.IntMap Int 63 insWith :: [(Int, Int)] -> M.IntMap Int -> M.IntMap Int 66 insWithKey :: [(Int, Int)] -> M.IntMap Int -> M.IntMap Int 69 insWith' :: [(Int, Int)] -> M.IntMap Int -> M.IntMap Int 72 insWithKey' :: [(Int, Int)] -> M.IntMap Int -> M.IntMap Int 77 insLookupWithKey :: [(Int, Int)] -> M.IntMap Int -> (Int, M.IntMap Int) 83 del :: [Int] -> M.IntMap Int -> M.IntMap Int 86 upd :: [Int] -> M.IntMap Int -> M.IntMap Int 89 upd' :: [Int] -> M.IntMap Int -> M.IntMap Int [all …]
|
/dports/lang/elm/compiler-0.19.1/_cabal_deps/containers-0.5.11.0/benchmarks/ |
H A D | IntMap.hs | 8 import qualified Data.IntMap as M 60 ins :: [(Int, Int)] -> M.IntMap Int -> M.IntMap Int 63 insWith :: [(Int, Int)] -> M.IntMap Int -> M.IntMap Int 66 insWithKey :: [(Int, Int)] -> M.IntMap Int -> M.IntMap Int 69 insWith' :: [(Int, Int)] -> M.IntMap Int -> M.IntMap Int 72 insWithKey' :: [(Int, Int)] -> M.IntMap Int -> M.IntMap Int 77 insLookupWithKey :: [(Int, Int)] -> M.IntMap Int -> (Int, M.IntMap Int) 83 del :: [Int] -> M.IntMap Int -> M.IntMap Int 86 upd :: [Int] -> M.IntMap Int -> M.IntMap Int 89 upd' :: [Int] -> M.IntMap Int -> M.IntMap Int [all …]
|
/dports/lang/elm/compiler-0.19.1/_cabal_deps/containers-0.5.11.0/Data/ |
H A D | IntMap.hs | 55 module Data.IntMap 56 ( module Data.IntMap.Lazy 64 import qualified Data.IntMap.Strict as Strict 65 import Data.IntMap.Lazy 71 insertWith' :: (a -> a -> a) -> Key -> a -> IntMap a -> IntMap a 78 insertWithKey' :: (Key -> a -> a -> a) -> Key -> a -> IntMap a -> IntMap a 85 fold :: (a -> b -> b) -> b -> IntMap a -> b 94 foldWithKey :: (Key -> a -> b -> b) -> b -> IntMap a -> b
|
/dports/net-im/matterhorn/matterhorn-50200.13.0/_cabal_deps/brick-0.62/tests/ |
H A D | Main.hs | 10 import Data.IntMap (IntMap) 13 import qualified Data.IntMap as IntMap 26 lower :: IMap v -> IntMap v 27 lower m = IntMap.fromDistinctAscList 33 raise :: Eq v => IntMap v -> IMap v 42 lowerRun :: Int -> Run v -> IntMap v 50 prop_raiseLowerFaithful :: IntMap O -> Bool 75 prop_empty = lower (IMap.empty :: I) == IntMap.empty 89 (lt, eq, gt') = IntMap.splitLookup k (lower m) 90 le' = maybe id (IntMap.insert k) eq lt [all …]
|
/dports/finance/hs-hledger-ui/hledger-ui-1.19/_cabal_deps/brick-0.62/tests/ |
H A D | Main.hs | 10 import Data.IntMap (IntMap) 13 import qualified Data.IntMap as IntMap 26 lower :: IMap v -> IntMap v 27 lower m = IntMap.fromDistinctAscList 33 raise :: Eq v => IntMap v -> IMap v 42 lowerRun :: Int -> Run v -> IntMap v 50 prop_raiseLowerFaithful :: IntMap O -> Bool 75 prop_empty = lower (IMap.empty :: I) == IntMap.empty 89 (lt, eq, gt') = IntMap.splitLookup k (lower m) 90 le' = maybe id (IntMap.insert k) eq lt [all …]
|
/dports/devel/hs-git-brunch/git-brunch-1.5.1.0/_cabal_deps/brick-0.62/tests/ |
H A D | Main.hs | 10 import Data.IntMap (IntMap) 13 import qualified Data.IntMap as IntMap 26 lower :: IMap v -> IntMap v 27 lower m = IntMap.fromDistinctAscList 33 raise :: Eq v => IntMap v -> IMap v 42 lowerRun :: Int -> Run v -> IntMap v 50 prop_raiseLowerFaithful :: IntMap O -> Bool 75 prop_empty = lower (IMap.empty :: I) == IntMap.empty 89 (lt, eq, gt') = IntMap.splitLookup k (lower m) 90 le' = maybe id (IntMap.insert k) eq lt [all …]
|
/dports/misc/hs-hascard/hascard-0.3.0.1/_cabal_deps/brick-0.55/tests/ |
H A D | Main.hs | 10 import Data.IntMap (IntMap) 13 import qualified Data.IntMap as IntMap 26 lower :: IMap v -> IntMap v 27 lower m = IntMap.fromDistinctAscList 33 raise :: Eq v => IntMap v -> IMap v 42 lowerRun :: Int -> Run v -> IntMap v 50 prop_raiseLowerFaithful :: IntMap O -> Bool 75 prop_empty = lower (IMap.empty :: I) == IntMap.empty 89 (lt, eq, gt') = IntMap.splitLookup k (lower m) 90 le' = maybe id (IntMap.insert k) eq lt [all …]
|
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/retrie-0.1.1.1/Retrie/PatternMap/ |
H A D | Bag.hs | 13 import qualified Data.IntMap as I 62 newtype IntMap a = IntMap { unIntMap :: I.IntMap [a] } function 66 type Key IntMap = I.Key 68 mEmpty :: IntMap a 69 mEmpty = IntMap I.empty 71 mUnion :: IntMap a -> IntMap a -> IntMap a 72 mUnion (IntMap m1) (IntMap m2) = IntMap $ I.unionWith (++) m1 m2 74 mAlter :: AlphaEnv -> Quantifiers -> Key IntMap -> A a -> IntMap a -> IntMap a 75 mAlter _ _ i f (IntMap m) = IntMap $ I.alter (toAList f) i m 79 -> Key IntMap [all …]
|
/dports/lang/ocaml-nox11/ocaml-4.05.0/testsuite/tests/basic/ |
H A D | maps.ml | 1 module IntMap = Map.Make(struct type t = int let compare x y = x-y end) module 3 let m1 = IntMap.add 0 "A" (IntMap.add 4 "Y" (IntMap.singleton 3 "X1")) 4 let m2 = IntMap.add 0 "B" (IntMap.add 4 "Y" (IntMap.singleton 5 "X2")) 6 let show m = IntMap.iter (fun k v -> Printf.printf "%d %s\n" k v) m 17 show (IntMap.merge f1 m1 m2); 25 show (IntMap.merge f2 m1 m2); 29 show (IntMap.union f3 m1 m2);
|
/dports/lang/ocaml/ocaml-4.05.0/testsuite/tests/basic/ |
H A D | maps.ml | 1 module IntMap = Map.Make(struct type t = int let compare x y = x-y end) module 3 let m1 = IntMap.add 0 "A" (IntMap.add 4 "Y" (IntMap.singleton 3 "X1")) 4 let m2 = IntMap.add 0 "B" (IntMap.add 4 "Y" (IntMap.singleton 5 "X2")) 6 let show m = IntMap.iter (fun k v -> Printf.printf "%d %s\n" k v) m 17 show (IntMap.merge f1 m1 m2); 25 show (IntMap.merge f2 m1 m2); 29 show (IntMap.union f3 m1 m2);
|