summaryrefslogtreecommitdiff
path: root/Userland/Libraries/LibIPC/Dictionary.h
diff options
context:
space:
mode:
Diffstat (limited to 'Userland/Libraries/LibIPC/Dictionary.h')
-rw-r--r--Userland/Libraries/LibIPC/Dictionary.h65
1 files changed, 65 insertions, 0 deletions
diff --git a/Userland/Libraries/LibIPC/Dictionary.h b/Userland/Libraries/LibIPC/Dictionary.h
new file mode 100644
index 0000000000..34632a86e9
--- /dev/null
+++ b/Userland/Libraries/LibIPC/Dictionary.h
@@ -0,0 +1,65 @@
+/*
+ * Copyright (c) 2020, Andreas Kling <kling@serenityos.org>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright notice, this
+ * list of conditions and the following disclaimer.
+ *
+ * 2. Redistributions in binary form must reproduce the above copyright notice,
+ * this list of conditions and the following disclaimer in the documentation
+ * and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+ * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+ * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#pragma once
+
+#include <AK/HashMap.h>
+#include <AK/String.h>
+
+namespace IPC {
+
+class Dictionary {
+public:
+ Dictionary() { }
+
+ Dictionary(const HashMap<String, String>& initial_entries)
+ : m_entries(initial_entries)
+ {
+ }
+
+ bool is_empty() const { return m_entries.is_empty(); }
+ size_t size() const { return m_entries.size(); }
+
+ void add(String key, String value)
+ {
+ m_entries.set(move(key), move(value));
+ }
+
+ template<typename Callback>
+ void for_each_entry(Callback callback) const
+ {
+ for (auto& it : m_entries) {
+ callback(it.key, it.value);
+ }
+ }
+
+ const HashMap<String, String>& entries() const { return m_entries; }
+
+private:
+ HashMap<String, String> m_entries;
+};
+
+}