summaryrefslogtreecommitdiffstats
path: root/include/plist/Dictionary.h
blob: 38604c8a327f34b0dee76610cb4a09a8b45710bc (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
/*
 * Dictionary.h
 * Dictionary node type for C++ binding
 *
 * Copyright (c) 2009 Jonathan Beck All Rights Reserved.
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 * 
 * This library 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
 * Lesser General Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA 
 */

#ifndef PLIST__DICTIONARY_H
#define PLIST__DICTIONARY_H

#include <plist/Structure.h>
#include <map>
#include <string>

namespace PList
{

class Dictionary : public Structure
{
    public :
        Dictionary(Node* parent = NULL);
        Dictionary(plist_t node, Node* parent = NULL);
	Dictionary(Dictionary& d);
	Dictionary& operator=(Dictionary& d);
	virtual ~Dictionary();

	Node* Clone();

	typedef std::map<std::string,Node*>::iterator iterator;
	
	Node* operator[](const std::string& key);
	iterator Begin();
	iterator End();
	iterator Find(const std::string& key);
	iterator Insert(const std::string& key, Node* node);
	void Remove(Node* node);
	void Remove(const std::string& key);
	
    private :
	std::map<std::string,Node*> _map;


};

};

#endif // PLIST__DICTIONARY_H