mirror of
https://github.com/RGBCube/serenity
synced 2025-10-31 20:12:43 +00:00
2e6d59b7b2
A clipping now consists of three things: - The raw clip data - A MIME type - A key-value map (String, String) for anything you like
65 lines
2.1 KiB
C++
65 lines
2.1 KiB
C++
/*
|
|
* 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;
|
|
};
|
|
|
|
}
|