root / Ganeti / HTools / Container.hs @ 8bcdde0c
History | View | Annotate | Download (3 kB)
1 |
{-| Module abstracting the node and instance container implementation. |
---|---|
2 |
|
3 |
This is currently implemented on top of an 'IntMap', which seems to |
4 |
give the best performance for our workload. |
5 |
|
6 |
-} |
7 |
|
8 |
{- |
9 |
|
10 |
Copyright (C) 2009 Google Inc. |
11 |
|
12 |
This program is free software; you can redistribute it and/or modify |
13 |
it under the terms of the GNU General Public License as published by |
14 |
the Free Software Foundation; either version 2 of the License, or |
15 |
(at your option) any later version. |
16 |
|
17 |
This program is distributed in the hope that it will be useful, but |
18 |
WITHOUT ANY WARRANTY; without even the implied warranty of |
19 |
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
20 |
General Public License for more details. |
21 |
|
22 |
You should have received a copy of the GNU General Public License |
23 |
along with this program; if not, write to the Free Software |
24 |
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA |
25 |
02110-1301, USA. |
26 |
|
27 |
-} |
28 |
|
29 |
module Ganeti.HTools.Container |
30 |
( |
31 |
-- * Types |
32 |
Container |
33 |
, Key |
34 |
-- * Creation |
35 |
, empty |
36 |
, fromAssocList |
37 |
-- * Query |
38 |
, size |
39 |
, find |
40 |
-- * Update |
41 |
, add |
42 |
, addTwo |
43 |
, remove |
44 |
, IntMap.map |
45 |
, IntMap.mapAccum |
46 |
-- * Conversion |
47 |
, elems |
48 |
, keys |
49 |
-- * Element functions |
50 |
, nameOf |
51 |
, maxNameLen |
52 |
, findByName |
53 |
) where |
54 |
|
55 |
import qualified Data.IntMap as IntMap |
56 |
|
57 |
import qualified Ganeti.HTools.Types as T |
58 |
|
59 |
type Key = IntMap.Key |
60 |
type Container = IntMap.IntMap |
61 |
|
62 |
-- | Create an empty container. |
63 |
empty :: Container a |
64 |
empty = IntMap.empty |
65 |
|
66 |
-- | Returns the number of elements in the map. |
67 |
size :: Container a -> Int |
68 |
size = IntMap.size |
69 |
|
70 |
-- | Locate a key in the map (must exist). |
71 |
find :: Key -> Container a -> a |
72 |
find k = (IntMap.! k) |
73 |
|
74 |
-- | Add or update one element to the map. |
75 |
add :: Key -> a -> Container a -> Container a |
76 |
add = IntMap.insert |
77 |
|
78 |
-- | Remove an element from the map. |
79 |
remove :: Key -> Container a -> Container a |
80 |
remove = IntMap.delete |
81 |
|
82 |
-- | Return the list of values in the map. |
83 |
elems :: Container a -> [a] |
84 |
elems = IntMap.elems |
85 |
|
86 |
-- | Return the list of keys in the map. |
87 |
keys :: Container a -> [Key] |
88 |
keys = IntMap.keys |
89 |
|
90 |
-- | Create a map from an association list. |
91 |
fromAssocList :: [(Key, a)] -> Container a |
92 |
fromAssocList = IntMap.fromList |
93 |
|
94 |
-- | Add or update two elements of the map. |
95 |
addTwo :: Key -> a -> Key -> a -> Container a -> Container a |
96 |
addTwo k1 v1 k2 v2 = add k1 v1 . add k2 v2 |
97 |
|
98 |
-- | Compute the name of an element in a container. |
99 |
nameOf :: (T.Element a) => Container a -> Key -> String |
100 |
nameOf c k = T.nameOf $ find k c |
101 |
|
102 |
-- | Compute the maximum name length in an Element Container. |
103 |
maxNameLen :: (T.Element a) => Container a -> Int |
104 |
maxNameLen = maximum . map (length . T.nameOf) . elems |
105 |
|
106 |
-- | Find an element by name in a Container; this is a very slow function. |
107 |
findByName :: (T.Element a, Monad m) => |
108 |
Container a -> String -> m a |
109 |
findByName c n = |
110 |
let all_elems = elems c |
111 |
result = filter ((== n) . T.nameOf) all_elems |
112 |
in case result of |
113 |
[item] -> return item |
114 |
_ -> fail $ "Wrong number of elems found with name " ++ n |