summaryrefslogtreecommitdiffstats
path: root/example/trie_map.cpp
diff options
context:
space:
mode:
authorDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-15 05:46:17 +0000
committerDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-15 05:46:17 +0000
commit85adc697d2ec2a379ce6d721f0419ae5df3abdb6 (patch)
tree265f329bc4544c6f11a27ac3fd6022f593a10c11 /example/trie_map.cpp
parentInitial commit. (diff)
downloadmdds-85adc697d2ec2a379ce6d721f0419ae5df3abdb6.tar.xz
mdds-85adc697d2ec2a379ce6d721f0419ae5df3abdb6.zip
Adding upstream version 2.1.1.upstream/2.1.1upstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'example/trie_map.cpp')
-rw-r--r--example/trie_map.cpp111
1 files changed, 111 insertions, 0 deletions
diff --git a/example/trie_map.cpp b/example/trie_map.cpp
new file mode 100644
index 0000000..445a9c7
--- /dev/null
+++ b/example/trie_map.cpp
@@ -0,0 +1,111 @@
+/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
+/*************************************************************************
+ *
+ * Copyright (c) 2020 Kohei Yoshida
+ *
+ * Permission is hereby granted, free of charge, to any person
+ * obtaining a copy of this software and associated documentation
+ * files (the "Software"), to deal in the Software without
+ * restriction, including without limitation the rights to use,
+ * copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following
+ * conditions:
+ *
+ * The above copyright notice and this permission notice shall be
+ * included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+ * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+ * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+ * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+ * OTHER DEALINGS IN THE SOFTWARE.
+ *
+ ************************************************************************/
+
+#include <mdds/trie_map.hpp>
+#include <iostream>
+
+using std::cout;
+using std::endl;
+
+int main()
+{
+ using trie_map_type = mdds::trie_map<mdds::trie::std_string_traits, int>;
+
+ // Cities in North Carolina and their populations in 2013.
+ trie_map_type nc_cities;
+
+ // Insert key-value pairs.
+ nc_cities.insert("Charlotte", 792862);
+ nc_cities.insert("Raleigh", 431746);
+ nc_cities.insert("Greensboro", 279639);
+ nc_cities.insert("Durham", 245475);
+ nc_cities.insert("Winston-Salem", 236441);
+ nc_cities.insert("Fayetteville", 204408);
+ nc_cities.insert("Cary", 151088);
+ nc_cities.insert("Wilmington", 112067);
+ nc_cities.insert("High Point", 107741);
+ nc_cities.insert("Greenville", 89130);
+ nc_cities.insert("Asheville", 87236);
+ nc_cities.insert("Concord", 83506);
+ nc_cities.insert("Gastonia", 73209);
+ nc_cities.insert("Jacksonville", 69079);
+ nc_cities.insert("Chapel Hill", 59635);
+ nc_cities.insert("Rocky Mount", 56954);
+ nc_cities.insert("Burlington", 51510);
+ nc_cities.insert("Huntersville", 50458);
+ nc_cities.insert("Wilson", 49628);
+ nc_cities.insert("Kannapolis", 44359);
+ nc_cities.insert("Apex", 42214);
+ nc_cities.insert("Hickory", 40361);
+ nc_cities.insert("Goldsboro", 36306);
+
+ cout << "Cities that start with 'Cha' and their populations:" << endl;
+ auto results = nc_cities.prefix_search("Cha");
+ for (const auto& kv : results)
+ {
+ cout << " " << kv.first << ": " << kv.second << endl;
+ }
+
+ cout << "Cities that start with 'W' and their populations:" << endl;
+ results = nc_cities.prefix_search("W");
+ for (const auto& kv : results)
+ {
+ cout << " " << kv.first << ": " << kv.second << endl;
+ }
+
+ // Create a compressed version of the container. It works nearly identically.
+ auto packed = nc_cities.pack();
+
+ cout << "Cities that start with 'C' and their populations:" << endl;
+ auto packed_results = packed.prefix_search("C");
+ for (const auto& kv : packed_results)
+ {
+ cout << " " << kv.first << ": " << kv.second << endl;
+ }
+
+ // Individual search.
+ auto it = packed.find("Wilmington");
+ cout << "Population of Wilmington: " << it->second << endl;
+
+ // You get an end position iterator when the container doesn't have the
+ // specified key.
+ it = packed.find("Asheboro");
+
+ cout << "Population of Asheboro: ";
+
+ if (it == packed.end())
+ cout << "not found";
+ else
+ cout << it->second;
+
+ cout << endl;
+
+ return EXIT_SUCCESS;
+}
+
+/* vim:set shiftwidth=4 softtabstop=4 expandtab: */