summaryrefslogtreecommitdiff
path: root/grc/python/base/odict.py
blob: 70ab67d0534c73676e92992b5b494e9b28191e8d (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
"""
Copyright 2008-2011 Free Software Foundation, Inc.
This file is part of GNU Radio

GNU Radio Companion is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.

GNU Radio Companion is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA
"""

from UserDict import DictMixin

class odict(DictMixin):

    def __init__(self, d={}):
        self._keys = list(d.keys())
        self._data = dict(d.copy())

    def __setitem__(self, key, value):
        if key not in self._data:
            self._keys.append(key)
        self._data[key] = value

    def __getitem__(self, key):
        return self._data[key]

    def __delitem__(self, key):
        del self._data[key]
        self._keys.remove(key)

    def keys(self):
        return list(self._keys)

    def copy(self):
        copy_dict = odict()
        copy_dict._data = self._data.copy()
        copy_dict._keys = list(self._keys)
        return copy_dict

    def insert_after(self, pos_key, key, val):
        """
        Insert the new key, value entry after the entry given by the position key.
        If the positional key is None, insert at the end.

        Args:
            pos_key: the positional key
            key: the key for the new entry
            val: the value for the new entry
        """
        index = (pos_key is None) and len(self._keys) or self._keys.index(pos_key)
        if key in self._keys: raise KeyError('Cannot insert, key "%s" already exists'%str(key))
        self._keys.insert(index+1, key)
        self._data[key] = val

    def insert_before(self, pos_key, key, val):
        """
        Insert the new key, value entry before the entry given by the position key.
        If the positional key is None, insert at the begining.

        Args:
            pos_key: the positional key
            key: the key for the new entry
            val: the value for the new entry
        """
        index = (pos_key is not None) and self._keys.index(pos_key) or 0
        if key in self._keys: raise KeyError('Cannot insert, key "%s" already exists'%str(key))
        self._keys.insert(index, key)
        self._data[key] = val

    def find(self, key):
        """
        Get the value for this key if exists.

        Args:
            key: the key to search for

        Returns:
            the value or None
        """
        if self.has_key(key): return self[key]
        return None

    def findall(self, key):
        """
        Get a list of values for this key.

        Args:
            key: the key to search for

        Returns:
            a list of values or empty list
        """
        obj = self.find(key)
        if obj is None: obj = list()
        if isinstance(obj, list): return obj
        return [obj]