Statistics
| Branch: | Tag: | Revision:

root / htools / Ganeti / HTools / Container.hs @ a86fbf36

History | View | Annotate | Download (2.4 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, 2010, 2011 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
    , IntMap.empty
36
    , IntMap.singleton
37
    , IntMap.fromList
38
     -- * Query
39
    , IntMap.size
40
    , IntMap.null
41
    , find
42
    , IntMap.findMax
43
    , IntMap.member
44
     -- * Update
45
    , add
46
    , addTwo
47
    , IntMap.map
48
    , IntMap.mapAccum
49
    , IntMap.filter
50
    -- * Conversion
51
    , IntMap.elems
52
    , IntMap.keys
53
    -- * Element functions
54
    , nameOf
55
    , findByName
56
    ) where
57

    
58
import qualified Data.IntMap as IntMap
59

    
60
import qualified Ganeti.HTools.Types as T
61

    
62
type Key = IntMap.Key
63
type Container = IntMap.IntMap
64

    
65
-- | Locate a key in the map (must exist).
66
find :: Key -> Container a -> a
67
find k = (IntMap.! k)
68

    
69
-- | Add or update one element to the map.
70
add :: Key -> a -> Container a -> Container a
71
add = IntMap.insert
72

    
73
-- | Add or update two elements of the map.
74
addTwo :: Key -> a -> Key -> a -> Container a -> Container a
75
addTwo k1 v1 k2 v2 = add k1 v1 . add k2 v2
76

    
77
-- | Compute the name of an element in a container.
78
nameOf :: (T.Element a) => Container a -> Key -> String
79
nameOf c k = T.nameOf $ find k c
80

    
81
-- | Find an element by name in a Container; this is a very slow function.
82
findByName :: (T.Element a, Monad m) =>
83
              Container a -> String -> m a
84
findByName c n =
85
    let all_elems = IntMap.elems c
86
        result = filter ((n `elem`) . T.allNames) all_elems
87
    in case result of
88
         [item] -> return item
89
         _ -> fail $ "Wrong number of elems found with name " ++ n