From 85446f38f3a3011618dab810167e6bbfd97901ca Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Fri, 21 Jul 2023 05:10:50 +0000 Subject: [PATCH] Documentation for 170f7e59ff6732996d010bc7eec62e6d9e5279e9 --- annotated.html | 34 +- annotated_dup.js | 7 +- classes.html | 6 +- d0/dd2/treap_8cpp.html | 260 +++++ d0/dd2/treap_8cpp.js | 7 + ...8dca7b867074164d5f45b0f3851269d_cgraph.map | 34 + ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 | 1 + ...8dca7b867074164d5f45b0f3851269d_cgraph.svg | 394 ++++++++ ...7b867074164d5f45b0f3851269d_cgraph_org.svg | 312 ++++++ ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 36 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 412 ++++++++ ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg | 330 +++++++ ...ctures_1_1treap_1_1_treap__coll__graph.map | 7 + ...ctures_1_1treap_1_1_treap__coll__graph.md5 | 1 + ...ctures_1_1treap_1_1_treap__coll__graph.svg | 89 ++ ...es_1_1treap_1_1_treap__coll__graph_org.svg | 64 ++ ...ctdata__structures_1_1treap_1_1_treap.html | 905 ++++++++++++++++++ ...ructdata__structures_1_1treap_1_1_treap.js | 23 + ...e884d2686aff501ef589b0d1185492f_cgraph.map | 11 + ...e884d2686aff501ef589b0d1185492f_cgraph.md5 | 1 + ...e884d2686aff501ef589b0d1185492f_cgraph.svg | 179 ++++ ...d2686aff501ef589b0d1185492f_cgraph_org.svg | 97 ++ ...a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.map | 9 + ...a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.md5 | 1 + ...a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.svg | 103 ++ ...a4f0c42fb8ed5b3368fba1a5f2c_cgraph_org.svg | 78 ++ ...5a48584a6560de20484fbba6229fd29_cgraph.map | 5 + ...5a48584a6560de20484fbba6229fd29_cgraph.md5 | 1 + ...5a48584a6560de20484fbba6229fd29_cgraph.svg | 66 ++ ...584a6560de20484fbba6229fd29_cgraph_org.svg | 41 + ...a77d22f97add119123108211c6655ec_cgraph.map | 4 + ...a77d22f97add119123108211c6655ec_cgraph.md5 | 1 + ...a77d22f97add119123108211c6655ec_cgraph.svg | 56 ++ ...22f97add119123108211c6655ec_cgraph_org.svg | 31 + ...ea2becd904e2e7d22f23a001b444469_cgraph.map | 11 + ...ea2becd904e2e7d22f23a001b444469_cgraph.md5 | 1 + ...ea2becd904e2e7d22f23a001b444469_cgraph.svg | 179 ++++ ...ecd904e2e7d22f23a001b444469_cgraph_org.svg | 97 ++ ...2db3ad3aecc240011e0c8b8604d2c69_cgraph.map | 6 + ...2db3ad3aecc240011e0c8b8604d2c69_cgraph.md5 | 1 + ...2db3ad3aecc240011e0c8b8604d2c69_cgraph.svg | 75 ++ ...ad3aecc240011e0c8b8604d2c69_cgraph_org.svg | 50 + ...94e9d69305940f6d8804031455af039_cgraph.map | 6 + ...94e9d69305940f6d8804031455af039_cgraph.md5 | 1 + ...94e9d69305940f6d8804031455af039_cgraph.svg | 75 ++ ...d69305940f6d8804031455af039_cgraph_org.svg | 50 + ...08520c0617eb8dcfcbfa90d258aa6b2_cgraph.map | 4 + ...08520c0617eb8dcfcbfa90d258aa6b2_cgraph.md5 | 1 + ...08520c0617eb8dcfcbfa90d258aa6b2_cgraph.svg | 56 ++ ...0c0617eb8dcfcbfa90d258aa6b2_cgraph_org.svg | 31 + ...b4bb0db68c7c04ef9498c88c3777887_cgraph.map | 9 + ...b4bb0db68c7c04ef9498c88c3777887_cgraph.md5 | 1 + ...b4bb0db68c7c04ef9498c88c3777887_cgraph.svg | 103 ++ ...0db68c7c04ef9498c88c3777887_cgraph_org.svg | 78 ++ da/de6/treap_8cpp__incl.map | 9 + da/de6/treap_8cpp__incl.md5 | 1 + da/de6/treap_8cpp__incl.svg | 100 ++ da/de6/treap_8cpp__incl_org.svg | 75 ++ ...structures_1_1treap_1_1_treap-members.html | 135 +++ dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html | 3 + dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js | 1 + files.html | 9 +- functions.html | 4 + functions_c.html | 2 + functions_e.html | 2 +- functions_func.html | 4 + functions_func_e.html | 2 +- functions_func_g.html | 4 + functions_func_i.html | 6 +- functions_func_r.html | 1 + functions_func_t.html | 1 + functions_func_u.html | 4 +- functions_g.html | 4 + functions_i.html | 6 +- functions_k.html | 2 +- functions_p.html | 1 + functions_r.html | 3 +- functions_s.html | 2 +- functions_t.html | 2 + functions_u.html | 4 +- functions_vars.html | 10 +- globals_func_i.html | 2 +- globals_func_m.html | 2 +- globals_func_t.html | 2 +- globals_i.html | 2 +- globals_m.html | 2 +- globals_t.html | 2 +- hierarchy.html | 43 +- hierarchy.js | 5 +- inherit_graph_100.map | 2 +- inherit_graph_100.md5 | 2 +- inherit_graph_100.svg | 10 +- inherit_graph_101.map | 2 +- inherit_graph_101.md5 | 2 +- inherit_graph_101.svg | 10 +- inherit_graph_102.map | 2 +- inherit_graph_102.md5 | 2 +- inherit_graph_102.svg | 10 +- inherit_graph_103.map | 2 +- inherit_graph_103.md5 | 2 +- inherit_graph_103.svg | 10 +- inherit_graph_104.map | 2 +- inherit_graph_104.md5 | 2 +- inherit_graph_104.svg | 10 +- inherit_graph_105.map | 2 +- inherit_graph_105.md5 | 2 +- inherit_graph_105.svg | 4 +- inherit_graph_106.map | 3 + inherit_graph_106.md5 | 1 + inherit_graph_106.svg | 21 + inherit_graph_23.map | 2 +- inherit_graph_23.md5 | 2 +- inherit_graph_23.svg | 12 +- inherit_graph_24.map | 2 +- inherit_graph_24.md5 | 2 +- inherit_graph_24.svg | 4 +- inherit_graph_25.map | 2 +- inherit_graph_25.md5 | 2 +- inherit_graph_25.svg | 13 +- inherit_graph_26.map | 2 +- inherit_graph_26.md5 | 2 +- inherit_graph_26.svg | 13 +- inherit_graph_27.map | 2 +- inherit_graph_27.md5 | 2 +- inherit_graph_27.svg | 10 +- inherit_graph_28.map | 2 +- inherit_graph_28.md5 | 2 +- inherit_graph_28.svg | 15 +- inherit_graph_29.map | 2 +- inherit_graph_29.md5 | 2 +- inherit_graph_29.svg | 14 +- inherit_graph_30.map | 2 +- inherit_graph_30.md5 | 2 +- inherit_graph_30.svg | 10 +- inherit_graph_31.map | 2 +- inherit_graph_31.md5 | 2 +- inherit_graph_31.svg | 10 +- inherit_graph_32.map | 2 +- inherit_graph_32.md5 | 2 +- inherit_graph_32.svg | 10 +- inherit_graph_33.map | 2 +- inherit_graph_33.md5 | 2 +- inherit_graph_33.svg | 10 +- inherit_graph_34.map | 2 +- inherit_graph_34.md5 | 2 +- inherit_graph_34.svg | 10 +- inherit_graph_35.map | 2 +- inherit_graph_35.md5 | 2 +- inherit_graph_35.svg | 10 +- inherit_graph_36.map | 2 +- inherit_graph_36.md5 | 2 +- inherit_graph_36.svg | 13 +- inherit_graph_37.map | 2 +- inherit_graph_37.md5 | 2 +- inherit_graph_37.svg | 13 +- inherit_graph_38.map | 2 +- inherit_graph_38.md5 | 2 +- inherit_graph_38.svg | 10 +- inherit_graph_39.map | 2 +- inherit_graph_39.md5 | 2 +- inherit_graph_39.svg | 10 +- inherit_graph_40.map | 4 +- inherit_graph_40.md5 | 2 +- inherit_graph_40.svg | 28 +- inherit_graph_41.map | 4 +- inherit_graph_41.md5 | 2 +- inherit_graph_41.svg | 28 +- inherit_graph_42.map | 2 +- inherit_graph_42.md5 | 2 +- inherit_graph_42.svg | 13 +- inherit_graph_43.map | 2 +- inherit_graph_43.md5 | 2 +- inherit_graph_43.svg | 13 +- inherit_graph_44.map | 2 +- inherit_graph_44.md5 | 2 +- inherit_graph_44.svg | 10 +- inherit_graph_45.map | 2 +- inherit_graph_45.md5 | 2 +- inherit_graph_45.svg | 10 +- inherit_graph_46.map | 2 +- inherit_graph_46.md5 | 2 +- inherit_graph_46.svg | 10 +- inherit_graph_47.map | 2 +- inherit_graph_47.md5 | 2 +- inherit_graph_47.svg | 10 +- inherit_graph_48.map | 2 +- inherit_graph_48.md5 | 2 +- inherit_graph_48.svg | 10 +- inherit_graph_49.map | 2 +- inherit_graph_49.md5 | 2 +- inherit_graph_49.svg | 10 +- inherit_graph_50.map | 2 +- inherit_graph_50.md5 | 2 +- inherit_graph_50.svg | 10 +- inherit_graph_51.map | 2 +- inherit_graph_51.md5 | 2 +- inherit_graph_51.svg | 10 +- inherit_graph_52.map | 2 +- inherit_graph_52.md5 | 2 +- inherit_graph_52.svg | 10 +- inherit_graph_53.map | 2 +- inherit_graph_53.md5 | 2 +- inherit_graph_53.svg | 14 +- inherit_graph_54.map | 2 +- inherit_graph_54.md5 | 2 +- inherit_graph_54.svg | 10 +- inherit_graph_55.map | 2 +- inherit_graph_55.md5 | 2 +- inherit_graph_55.svg | 10 +- inherit_graph_56.map | 2 +- inherit_graph_56.md5 | 2 +- inherit_graph_56.svg | 15 +- inherit_graph_57.map | 2 +- inherit_graph_57.md5 | 2 +- inherit_graph_57.svg | 12 +- inherit_graph_58.map | 2 +- inherit_graph_58.md5 | 2 +- inherit_graph_58.svg | 12 +- inherit_graph_59.map | 2 +- inherit_graph_59.md5 | 2 +- inherit_graph_59.svg | 10 +- inherit_graph_60.map | 2 +- inherit_graph_60.md5 | 2 +- inherit_graph_60.svg | 12 +- inherit_graph_61.map | 2 +- inherit_graph_61.md5 | 2 +- inherit_graph_61.svg | 13 +- inherit_graph_62.map | 2 +- inherit_graph_62.md5 | 2 +- inherit_graph_62.svg | 10 +- inherit_graph_63.map | 2 +- inherit_graph_63.md5 | 2 +- inherit_graph_63.svg | 10 +- inherit_graph_64.map | 2 +- inherit_graph_64.md5 | 2 +- inherit_graph_64.svg | 10 +- inherit_graph_65.map | 2 +- inherit_graph_65.md5 | 2 +- inherit_graph_65.svg | 10 +- inherit_graph_66.map | 2 +- inherit_graph_66.md5 | 2 +- inherit_graph_66.svg | 8 +- inherit_graph_67.map | 2 +- inherit_graph_67.md5 | 2 +- inherit_graph_67.svg | 14 +- inherit_graph_68.map | 2 +- inherit_graph_68.md5 | 2 +- inherit_graph_68.svg | 15 +- inherit_graph_69.map | 2 +- inherit_graph_69.md5 | 2 +- inherit_graph_69.svg | 10 +- inherit_graph_70.map | 2 +- inherit_graph_70.md5 | 2 +- inherit_graph_70.svg | 10 +- inherit_graph_71.map | 2 +- inherit_graph_71.md5 | 2 +- inherit_graph_71.svg | 10 +- inherit_graph_72.map | 2 +- inherit_graph_72.md5 | 2 +- inherit_graph_72.svg | 4 +- inherit_graph_73.map | 2 +- inherit_graph_73.md5 | 2 +- inherit_graph_73.svg | 12 +- inherit_graph_74.map | 2 +- inherit_graph_74.md5 | 2 +- inherit_graph_74.svg | 10 +- inherit_graph_75.map | 2 +- inherit_graph_75.md5 | 2 +- inherit_graph_75.svg | 12 +- inherit_graph_76.map | 2 +- inherit_graph_76.md5 | 2 +- inherit_graph_76.svg | 12 +- inherit_graph_77.map | 2 +- inherit_graph_77.md5 | 2 +- inherit_graph_77.svg | 12 +- inherit_graph_78.map | 2 +- inherit_graph_78.md5 | 2 +- inherit_graph_78.svg | 4 +- inherit_graph_79.map | 2 +- inherit_graph_79.md5 | 2 +- inherit_graph_79.svg | 13 +- inherit_graph_80.map | 2 +- inherit_graph_80.md5 | 2 +- inherit_graph_80.svg | 13 +- inherit_graph_81.map | 2 +- inherit_graph_81.md5 | 2 +- inherit_graph_81.svg | 12 +- inherit_graph_82.map | 2 +- inherit_graph_82.md5 | 2 +- inherit_graph_82.svg | 12 +- inherit_graph_83.map | 2 +- inherit_graph_83.md5 | 2 +- inherit_graph_83.svg | 13 +- inherit_graph_84.map | 2 +- inherit_graph_84.md5 | 2 +- inherit_graph_84.svg | 10 +- inherit_graph_85.map | 2 +- inherit_graph_85.md5 | 2 +- inherit_graph_85.svg | 10 +- inherit_graph_86.map | 6 +- inherit_graph_86.md5 | 2 +- inherit_graph_86.svg | 54 +- inherit_graph_87.map | 6 +- inherit_graph_87.md5 | 2 +- inherit_graph_87.svg | 54 +- inherit_graph_88.map | 2 +- inherit_graph_88.md5 | 2 +- inherit_graph_88.svg | 13 +- inherit_graph_89.map | 2 +- inherit_graph_89.md5 | 2 +- inherit_graph_89.svg | 13 +- inherit_graph_90.map | 2 +- inherit_graph_90.md5 | 2 +- inherit_graph_90.svg | 13 +- inherit_graph_91.map | 2 +- inherit_graph_91.md5 | 2 +- inherit_graph_91.svg | 13 +- inherit_graph_92.map | 2 +- inherit_graph_92.md5 | 2 +- inherit_graph_92.svg | 10 +- inherit_graph_93.map | 2 +- inherit_graph_93.md5 | 2 +- inherit_graph_93.svg | 10 +- inherit_graph_94.map | 2 +- inherit_graph_94.md5 | 2 +- inherit_graph_94.svg | 10 +- inherit_graph_95.map | 2 +- inherit_graph_95.md5 | 2 +- inherit_graph_95.svg | 10 +- inherit_graph_96.map | 2 +- inherit_graph_96.md5 | 2 +- inherit_graph_96.svg | 4 +- inherit_graph_97.map | 14 +- inherit_graph_97.md5 | 2 +- inherit_graph_97.svg | 122 +-- inherit_graph_98.map | 14 +- inherit_graph_98.md5 | 2 +- inherit_graph_98.svg | 123 ++- inherit_graph_99.map | 2 +- inherit_graph_99.md5 | 2 +- inherit_graph_99.svg | 13 +- inherits.html | 157 +-- navtreedata.js | 24 +- navtreeindex0.js | 50 +- navtreeindex1.js | 26 +- navtreeindex10.js | 72 +- navtreeindex11.js | 92 +- navtreeindex12.js | 72 +- navtreeindex13.js | 60 +- navtreeindex14.js | 25 + navtreeindex2.js | 44 +- navtreeindex3.js | 26 +- navtreeindex4.js | 56 +- navtreeindex5.js | 84 +- navtreeindex6.js | 80 +- navtreeindex7.js | 90 +- navtreeindex8.js | 62 +- navtreeindex9.js | 68 +- search/all_1.js | 26 +- search/all_11.js | 38 +- search/all_12.js | 4 +- search/all_13.js | 20 +- search/all_14.js | 10 +- search/all_15.js | 105 +- search/all_16.js | 12 +- search/all_2.js | 142 +-- search/all_3.js | 63 +- search/all_4.js | 257 ++--- search/all_5.js | 4 +- search/all_6.js | 8 +- search/all_7.js | 4 +- search/all_8.js | 180 ++-- search/all_a.js | 22 +- search/all_c.js | 2 +- search/all_e.js | 213 +++-- search/all_f.js | 4 +- search/classes_0.js | 24 +- search/classes_10.js | 9 +- search/classes_13.js | 27 +- search/classes_d.js | 4 +- search/files_14.js | 11 +- search/functions_0.js | 12 +- search/functions_10.js | 4 +- search/functions_12.js | 95 +- search/functions_13.js | 4 +- search/functions_14.js | 56 +- search/functions_15.js | 6 +- search/functions_2.js | 4 +- search/functions_3.js | 4 +- search/functions_4.js | 4 +- search/functions_5.js | 8 +- search/functions_6.js | 147 ++- search/functions_7.js | 148 +-- search/functions_9.js | 30 +- search/functions_d.js | 109 ++- search/variables_10.js | 2 +- search/variables_11.js | 2 +- search/variables_12.js | 3 +- search/variables_3.js | 6 +- search/variables_a.js | 2 +- search/variables_c.js | 9 +- search/variables_e.js | 9 +- 403 files changed, 7156 insertions(+), 2316 deletions(-) create mode 100644 d0/dd2/treap_8cpp.html create mode 100644 d0/dd2/treap_8cpp.js create mode 100644 d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map create mode 100644 d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 create mode 100644 d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg create mode 100644 d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg create mode 100644 d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg create mode 100644 d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.map create mode 100644 d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.md5 create mode 100644 d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.svg create mode 100644 d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph_org.svg create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap.html create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap.js create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.map create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.md5 create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.svg create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph_org.svg create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.map create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.md5 create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.svg create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph_org.svg create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.map create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.md5 create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.svg create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph_org.svg create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.map create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.md5 create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.svg create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph_org.svg create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.map create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.md5 create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.svg create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph_org.svg create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.map create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.md5 create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.svg create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph_org.svg create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.map create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.md5 create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.svg create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph_org.svg create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.map create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.md5 create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.svg create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph_org.svg create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.map create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.md5 create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.svg create mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph_org.svg create mode 100644 da/de6/treap_8cpp__incl.map create mode 100644 da/de6/treap_8cpp__incl.md5 create mode 100644 da/de6/treap_8cpp__incl.svg create mode 100644 da/de6/treap_8cpp__incl_org.svg create mode 100644 df/ddb/structdata__structures_1_1treap_1_1_treap-members.html create mode 100644 inherit_graph_106.map create mode 100644 inherit_graph_106.md5 create mode 100644 inherit_graph_106.svg diff --git a/annotated.html b/annotated.html index 4e6a4691b..a854321d3 100644 --- a/annotated.html +++ b/annotated.html @@ -121,18 +121,20 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();  CSparse_table  Nstack_using_queue  CStackStack Class implementation for basic methods of Stack Data Structure - Ntree_234 - CNode2-3-4 tree node class - CTree2342-3-4 tree class - Ntrie_using_hashmap - CTrieTrie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix - CNodeStruct representing a trie node - CBitsetSimple bitset implementation for bloom filter - CBloomFilterBloom filter template class - CNode - CSegmentTreeClass representation of the segment tree - CSkipList - CtrieTrie implementation for small-case English alphabets a-z + Ntreap + CTreapStruct representation of the treap + Ntree_234 + CNode2-3-4 tree node class + CTree2342-3-4 tree class + Ntrie_using_hashmap + CTrieTrie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix + CNodeStruct representing a trie node + CBitsetSimple bitset implementation for bloom filter + CBloomFilterBloom filter template class + CNode + CSegmentTreeClass representation of the segment tree + CSkipList + CtrieTrie implementation for small-case English alphabets a-z  Ndivide_and_conquerFor std::vector  Nstrassens_multiplication  CMatrixMatrix class @@ -248,12 +250,12 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();  CMinHeap  CMinHeapNode  Cmst - Cnode - CNode + CNode + Cnode  CPoint  Cquery - Cqueue - CQueue + CQueue + Cqueue  CRBtree  CSegmentIntersection  CSolution diff --git a/annotated_dup.js b/annotated_dup.js index 92495cdcc..03b7bcfc6 100644 --- a/annotated_dup.js +++ b/annotated_dup.js @@ -27,6 +27,9 @@ var annotated_dup = [ "stack_using_queue", null, [ [ "Stack", "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html", "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack" ] ] ], + [ "treap", null, [ + [ "Treap", "d5/d95/structdata__structures_1_1treap_1_1_treap.html", "d5/d95/structdata__structures_1_1treap_1_1_treap" ] + ] ], [ "tree_234", null, [ [ "Node", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html", "dd/d40/classdata__structures_1_1tree__234_1_1_node" ], [ "Tree234", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234" ] @@ -192,12 +195,12 @@ var annotated_dup = [ "MinHeap", "d2/d05/class_min_heap.html", "d2/d05/class_min_heap" ], [ "MinHeapNode", "d5/d29/struct_min_heap_node.html", null ], [ "mst", "d1/d77/structmst.html", null ], - [ "node", "d5/da1/structnode.html", null ], [ "Node", "db/d8b/struct_node.html", null ], + [ "node", "d5/da1/structnode.html", null ], [ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ], [ "query", "dd/d1b/structquery.html", null ], - [ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ], [ "Queue", "dc/db5/struct_queue.html", null ], + [ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ], [ "RBtree", "d8/d72/class_r_btree.html", null ], [ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", "d4/db4/struct_segment_intersection" ], [ "Solution", "dd/d4f/class_solution.html", null ], diff --git a/classes.html b/classes.html index bac62953b..62b840e5d 100644 --- a/classes.html +++ b/classes.html @@ -140,13 +140,13 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
Matrix (divide_and_conquer::strassens_multiplication)
MinHeap
MinHeapNode
mst
N
-
NCRModuloP (math::ncr_modulo_p)
NeuralNetwork (machine_learning::neural_network)
Node (data_structures::linked_list)
Node (data_structures)
Node (data_structures::tree_234)
Trie::Node (data_structures::trie_using_hashmap)
node
Node
Node (operations_on_datastructures::circular_linked_list)
Node (operations_on_datastructures::inorder_traversal_of_bst)
Node (operations_on_datastructures::reverse_binary_tree)
Node (others::iterative_tree_traversals)
Node (others::recursive_tree_traversals)
perSegTree::Node (range_queries)
Node (search::sublist_search)
+
NCRModuloP (math::ncr_modulo_p)
NeuralNetwork (machine_learning::neural_network)
Node (data_structures::linked_list)
Node (data_structures)
Node (data_structures::tree_234)
Trie::Node (data_structures::trie_using_hashmap)
Node
node
Node (operations_on_datastructures::circular_linked_list)
Node (operations_on_datastructures::inorder_traversal_of_bst)
Node (operations_on_datastructures::reverse_binary_tree)
Node (others::iterative_tree_traversals)
Node (others::recursive_tree_traversals)
perSegTree::Node (range_queries)
Node (search::sublist_search)
P
pattern (strings::boyer_moore)
perSegTree (range_queries)
Point (ciphers::elliptic_curve_key_exchange)
Point (geometry::grahamscan)
Point (geometry::jarvis)
Point
Q
-
query
queue
Queue
Queue_Array (data_structures::queue_using_array)
+
query
Queue
queue
Queue_Array (data_structures::queue_using_array)
R
RBtree
RootedTree (graph)
@@ -155,7 +155,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
SegmentIntersection
SegmentTree (data_structures)
SG (range_queries::heavy_light_decomposition)
SkipList (data_structures)
Solution
Sparse_table (data_structures::sparse_table)
Stack (data_structures::stack_using_queue)
Stack (others::postfix_expression)
stack
stack_linkedList
stats_computer1 (statistics)
stats_computer2 (statistics)
T
-
TestCase
TestCases
Tnode (operations_on_datastructures::trie_operations)
tower
Tree (range_queries::heavy_light_decomposition)
Tree234 (data_structures::tree_234)
trie (data_structures)
Trie (data_structures::trie_using_hashmap)
Trie
Trie::TrieNode
+
TestCase
TestCases
Tnode (operations_on_datastructures::trie_operations)
tower
Treap (data_structures::treap)
Tree (range_queries::heavy_light_decomposition)
Tree234 (data_structures::tree_234)
trie (data_structures)
Trie (data_structures::trie_using_hashmap)
Trie
Trie::TrieNode
U
uint128_t
uint256_t
diff --git a/d0/dd2/treap_8cpp.html b/d0/dd2/treap_8cpp.html new file mode 100644 index 000000000..69985feae --- /dev/null +++ b/d0/dd2/treap_8cpp.html @@ -0,0 +1,260 @@ + + + + + + + +Algorithms_in_C++: data_structures/treap.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ 1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ +
+ +
treap.cpp File Reference
+
+
+ +

A balanced binary search tree (BST) on the basis of binary search tree and heap: the Treap algorithm implementation. +More...

+
#include <array>
+#include <cassert>
+#include <iostream>
+
+Include dependency graph for treap.cpp:
+
+
+
+
+ + + + +

+Classes

struct  data_structures::treap::Treap
 Struct representation of the treap. More...
 
+ + + + +

+Namespaces

namespace  data_structures
 for IO operations
 
+ + + + + + + +

+Functions

static void test ()
 Self-test implementations.
 
int main ()
 Main function.
 
+ + + + +

+Variables

+const int data_structures::treap::maxNode = 1e5 + 5
 maximum number of nodes
 
+

Detailed Description

+

A balanced binary search tree (BST) on the basis of binary search tree and heap: the Treap algorithm implementation.

+

Implementation of the treap data structre

+

Support operations including insert, erase, and query (the rank of specified element or the element ranked x) as the same as BST

+

But these operations take O(log N) time, since treap keeps property of heap using rotate operation, and the desired depth of the tree is O(log N). There's very little chance that it will degenerate into a chain like BST

+
Author
Kairao ZHENG
+

Function Documentation

+ +

◆ main()

+ +
+
+ + + + + + + + +
int main (void )
+
+ +

Main function.

+
Returns
0 on exit
+
256 {
+
257 test(); // run self-test implementations
+
258 return 0;
+
259}
+
static void test()
Self-test implementations.
Definition treap.cpp:230
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ test()

+ +
+
+ + + + + +
+ + + + + + + +
static void test ()
+
+static
+
+ +

Self-test implementations.

+
Returns
void
+

< Treap object instance

+
230 {
+
231 data_structures::treap::Treap mTreap; ///< Treap object instance
+
232
+
233 mTreap.insert(1);
+
234 mTreap.insert(2);
+
235 mTreap.insert(3);
+
236 assert(mTreap.get_k_th(2) == 2);
+
237 mTreap.insert(4);
+
238 mTreap.insert(5);
+
239 mTreap.insert(6);
+
240 assert(mTreap.get_next(4) == 5);
+
241 mTreap.insert(7);
+
242 assert(mTreap.get_predecessor(7) == 6);
+
243 mTreap.erase(4);
+
244 assert(mTreap.get_k_th(4) == 5);
+
245 assert(mTreap.get_rank(5) == 4);
+
246 mTreap.insert(10);
+
247 assert(mTreap.get_rank(10) == 7);
+
248 assert(mTreap.get_predecessor(10) == 7);
+
249
+
250 std::cout << "All tests have successfully passed!\n";
+
251}
+ +
Struct representation of the treap.
Definition treap.cpp:39
+
void insert(int k)
Insert element (External method)
Definition treap.cpp:204
+
int get_next(int k)
Get the successor node of element k.
Definition treap.cpp:189
+
void erase(int k)
Erase element (External method)
Definition treap.cpp:209
+
int get_k_th(int k)
Get the KTH largest value (External method)
Definition treap.cpp:215
+
int get_predecessor(int k)
Get the predecessor node of element k.
Definition treap.cpp:173
+
int get_rank(int k)
Get the rank of specified element (External method)
Definition treap.cpp:221
+
+Here is the call graph for this function:
+
+
+
+ +
+
+
+
+ + + + diff --git a/d0/dd2/treap_8cpp.js b/d0/dd2/treap_8cpp.js new file mode 100644 index 000000000..e02ab6a85 --- /dev/null +++ b/d0/dd2/treap_8cpp.js @@ -0,0 +1,7 @@ +var treap_8cpp = +[ + [ "data_structures::treap::Treap", "d5/d95/structdata__structures_1_1treap_1_1_treap.html", "d5/d95/structdata__structures_1_1treap_1_1_treap" ], + [ "main", "d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "test", "d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ], + [ "maxNode", "d0/dd2/treap_8cpp.html#ad939ec178d0069aeea14b7d6d7d12099", null ] +]; \ No newline at end of file diff --git a/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map new file mode 100644 index 000000000..91b9fde53 --- /dev/null +++ b/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -0,0 +1,34 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 new file mode 100644 index 000000000..4f6ebba9d --- /dev/null +++ b/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -0,0 +1 @@ +215c477708f08d0eb072d13ea138579a \ No newline at end of file diff --git a/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg new file mode 100644 index 000000000..b63c596af --- /dev/null +++ b/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -0,0 +1,394 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +test + + +Node1 + + +test + + + + + +Node2 + + +data_structures::treap +::Treap::erase + + + + + +Node1->Node2 + + + + + + + + +Node6 + + +data_structures::treap +::Treap::get_k_th + + + + + +Node1->Node6 + + + + + + + + +Node8 + + +data_structures::treap +::Treap::get_next + + + + + +Node1->Node8 + + + + + + + + +Node9 + + +data_structures::treap +::Treap::get_predecessor + + + + + +Node1->Node9 + + + + + + + + +Node10 + + +data_structures::treap +::Treap::get_rank + + + + + +Node1->Node10 + + + + + + + + +Node12 + + +data_structures::treap +::Treap::insert + + + + + +Node1->Node12 + + + + + + + + +Node3 + + +data_structures::treap +::Treap::_erase + + + + + +Node2->Node3 + + + + + + + + +Node3->Node3 + + + + + + + + +Node4 + + +data_structures::treap +::Treap::rotate + + + + + +Node3->Node4 + + + + + + + + +Node5 + + +data_structures::treap +::Treap::update + + + + + +Node3->Node5 + + + + + + + + +Node4->Node5 + + + + + + + + +Node7 + + +data_structures::treap +::Treap::_get_k_th + + + + + +Node6->Node7 + + + + + + + + +Node7->Node7 + + + + + + + + +Node11 + + +data_structures::treap +::Treap::_get_rank + + + + + +Node10->Node11 + + + + + + + + +Node11->Node11 + + + + + + + + +Node13 + + +data_structures::treap +::Treap::_insert + + + + + +Node12->Node13 + + + + + + + + +Node13->Node4 + + + + + + + + +Node13->Node5 + + + + + + + + +Node13->Node13 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg new file mode 100644 index 000000000..611b93473 --- /dev/null +++ b/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -0,0 +1,312 @@ + + + + + + +test + + +Node1 + + +test + + + + + +Node2 + + +data_structures::treap +::Treap::erase + + + + + +Node1->Node2 + + + + + + + + +Node6 + + +data_structures::treap +::Treap::get_k_th + + + + + +Node1->Node6 + + + + + + + + +Node8 + + +data_structures::treap +::Treap::get_next + + + + + +Node1->Node8 + + + + + + + + +Node9 + + +data_structures::treap +::Treap::get_predecessor + + + + + +Node1->Node9 + + + + + + + + +Node10 + + +data_structures::treap +::Treap::get_rank + + + + + +Node1->Node10 + + + + + + + + +Node12 + + +data_structures::treap +::Treap::insert + + + + + +Node1->Node12 + + + + + + + + +Node3 + + +data_structures::treap +::Treap::_erase + + + + + +Node2->Node3 + + + + + + + + +Node3->Node3 + + + + + + + + +Node4 + + +data_structures::treap +::Treap::rotate + + + + + +Node3->Node4 + + + + + + + + +Node5 + + +data_structures::treap +::Treap::update + + + + + +Node3->Node5 + + + + + + + + +Node4->Node5 + + + + + + + + +Node7 + + +data_structures::treap +::Treap::_get_k_th + + + + + +Node6->Node7 + + + + + + + + +Node7->Node7 + + + + + + + + +Node11 + + +data_structures::treap +::Treap::_get_rank + + + + + +Node10->Node11 + + + + + + + + +Node11->Node11 + + + + + + + + +Node13 + + +data_structures::treap +::Treap::_insert + + + + + +Node12->Node13 + + + + + + + + +Node13->Node4 + + + + + + + + +Node13->Node5 + + + + + + + + +Node13->Node13 + + + + + + + + diff --git a/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..13ce71b79 --- /dev/null +++ b/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,36 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..976c69548 --- /dev/null +++ b/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +003a4a7d1c5118f92ce5198573ce0e5f \ No newline at end of file diff --git a/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..10270aad1 --- /dev/null +++ b/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,412 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +main + + +Node1 + + +main + + + + + +Node2 + + +test + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +data_structures::treap +::Treap::erase + + + + + +Node2->Node3 + + + + + + + + +Node7 + + +data_structures::treap +::Treap::get_k_th + + + + + +Node2->Node7 + + + + + + + + +Node9 + + +data_structures::treap +::Treap::get_next + + + + + +Node2->Node9 + + + + + + + + +Node10 + + +data_structures::treap +::Treap::get_predecessor + + + + + +Node2->Node10 + + + + + + + + +Node11 + + +data_structures::treap +::Treap::get_rank + + + + + +Node2->Node11 + + + + + + + + +Node13 + + +data_structures::treap +::Treap::insert + + + + + +Node2->Node13 + + + + + + + + +Node4 + + +data_structures::treap +::Treap::_erase + + + + + +Node3->Node4 + + + + + + + + +Node4->Node4 + + + + + + + + +Node5 + + +data_structures::treap +::Treap::rotate + + + + + +Node4->Node5 + + + + + + + + +Node6 + + +data_structures::treap +::Treap::update + + + + + +Node4->Node6 + + + + + + + + +Node5->Node6 + + + + + + + + +Node8 + + +data_structures::treap +::Treap::_get_k_th + + + + + +Node7->Node8 + + + + + + + + +Node8->Node8 + + + + + + + + +Node12 + + +data_structures::treap +::Treap::_get_rank + + + + + +Node11->Node12 + + + + + + + + +Node12->Node12 + + + + + + + + +Node14 + + +data_structures::treap +::Treap::_insert + + + + + +Node13->Node14 + + + + + + + + +Node14->Node5 + + + + + + + + +Node14->Node6 + + + + + + + + +Node14->Node14 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg new file mode 100644 index 000000000..f0931b9c8 --- /dev/null +++ b/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -0,0 +1,330 @@ + + + + + + +main + + +Node1 + + +main + + + + + +Node2 + + +test + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +data_structures::treap +::Treap::erase + + + + + +Node2->Node3 + + + + + + + + +Node7 + + +data_structures::treap +::Treap::get_k_th + + + + + +Node2->Node7 + + + + + + + + +Node9 + + +data_structures::treap +::Treap::get_next + + + + + +Node2->Node9 + + + + + + + + +Node10 + + +data_structures::treap +::Treap::get_predecessor + + + + + +Node2->Node10 + + + + + + + + +Node11 + + +data_structures::treap +::Treap::get_rank + + + + + +Node2->Node11 + + + + + + + + +Node13 + + +data_structures::treap +::Treap::insert + + + + + +Node2->Node13 + + + + + + + + +Node4 + + +data_structures::treap +::Treap::_erase + + + + + +Node3->Node4 + + + + + + + + +Node4->Node4 + + + + + + + + +Node5 + + +data_structures::treap +::Treap::rotate + + + + + +Node4->Node5 + + + + + + + + +Node6 + + +data_structures::treap +::Treap::update + + + + + +Node4->Node6 + + + + + + + + +Node5->Node6 + + + + + + + + +Node8 + + +data_structures::treap +::Treap::_get_k_th + + + + + +Node7->Node8 + + + + + + + + +Node8->Node8 + + + + + + + + +Node12 + + +data_structures::treap +::Treap::_get_rank + + + + + +Node11->Node12 + + + + + + + + +Node12->Node12 + + + + + + + + +Node14 + + +data_structures::treap +::Treap::_insert + + + + + +Node13->Node14 + + + + + + + + +Node14->Node5 + + + + + + + + +Node14->Node6 + + + + + + + + +Node14->Node14 + + + + + + + + diff --git a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.map b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.map new file mode 100644 index 000000000..89b4682d8 --- /dev/null +++ b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.md5 b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.md5 new file mode 100644 index 000000000..d24e187d3 --- /dev/null +++ b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.md5 @@ -0,0 +1 @@ +50739112ee891e9d18129e02ad649cfd \ No newline at end of file diff --git a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.svg b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.svg new file mode 100644 index 000000000..7e940b7b7 --- /dev/null +++ b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.svg @@ -0,0 +1,89 @@ + + + + + + + + + + + +data_structures::treap::Treap + + +Node1 + + +data_structures::treap +::Treap + + + + + +Node2 + + +std::array< int, maxNode > + + + + + +Node2->Node1 + + + + + + cnt +key +priority +size + + + +Node3 + + +std::array< std::array +< int, 2 >, maxNode > + + + + + +Node3->Node1 + + + + + + childs + + + + + + + + diff --git a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph_org.svg b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph_org.svg new file mode 100644 index 000000000..0c5abac9d --- /dev/null +++ b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph_org.svg @@ -0,0 +1,64 @@ + + + + + + +data_structures::treap::Treap + + +Node1 + + +data_structures::treap +::Treap + + + + + +Node2 + + +std::array< int, maxNode > + + + + + +Node2->Node1 + + + + + + cnt +key +priority +size + + + +Node3 + + +std::array< std::array +< int, 2 >, maxNode > + + + + + +Node3->Node1 + + + + + + childs + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap.html b/d5/d95/structdata__structures_1_1treap_1_1_treap.html new file mode 100644 index 000000000..55eefabd3 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap.html @@ -0,0 +1,905 @@ + + + + + + + +Algorithms_in_C++: data_structures::treap::Treap Struct Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ 1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ +
+ +
data_structures::treap::Treap Struct Reference
+
+
+ +

Struct representation of the treap. + More...

+
+Collaboration diagram for data_structures::treap::Treap:
+
+
+
[legend]
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Treap ()
 Initialization.
 
void update (int x)
 Update the subtree size of the node.
 
void rotate (int &x, int t)
 Rotate without breaking the property of BST.
 
void _insert (int &x, int k)
 Insert a value into the specified subtree (internal method)
 
void _erase (int &x, int k)
 Erase a value from the specified subtree (internal method)
 
int _get_k_th (int &x, int k)
 Find the KTH largest value (internal method)
 
int _get_rank (int x, int k)
 Query the rank of specified element (internal method)
 
int get_predecessor (int k)
 Get the predecessor node of element k.
 
int get_next (int k)
 Get the successor node of element k.
 
void insert (int k)
 Insert element (External method)
 
void erase (int k)
 Erase element (External method)
 
int get_k_th (int k)
 Get the KTH largest value (External method)
 
int get_rank (int k)
 Get the rank of specified element (External method)
 
+ + + + + + + + + + + + + + + + + + + + + +

+Public Attributes

+int root = 0
 root of the treap
 
+int treapCnt = 0
 Total number of current nodes in the treap.
 
+std::array< int, maxNodekey = {}
 Node identifier.
 
+std::array< int, maxNodepriority = {}
 Random priority.
 
std::array< std::array< int, 2 >, maxNodechilds
 
std::array< int, maxNodecnt
 Maintains the subtree size for ranking query.
 
+std::array< int, maxNodesize = {}
 The number of copies per node.
 
+

Detailed Description

+

Struct representation of the treap.

+

Constructor & Destructor Documentation

+ +

◆ Treap()

+ +
+
+ + + + + +
+ + + + + + + +
data_structures::treap::Treap::Treap ()
+
+inline
+
+ +

Initialization.

+
54 : treapCnt(1) {
+
55 priority[0] = INT32_MAX;
+
56 size[0] = 0;
+
57 }
+
int treapCnt
Total number of current nodes in the treap.
Definition treap.cpp:41
+
std::array< int, maxNode > priority
Random priority.
Definition treap.cpp:43
+
std::array< int, maxNode > size
The number of copies per node.
Definition treap.cpp:50
+
+
+
+

Member Function Documentation

+ +

◆ _erase()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void data_structures::treap::Treap::_erase (int & x,
int k 
)
+
+inline
+
+ +

Erase a value from the specified subtree (internal method)

+
Parameters
+ + + +
xErase from the subtree of node x (Usually x=root)
kKey to erase
+
+
+
111 {
+
112 if (key[x] == k) {
+
113 if (cnt[x] > 1) {
+
114 cnt[x]--;
+
115 } // If the node has more than one copy, the number of copies --
+
116 else {
+
117 if (childs[x][0] == 0 && childs[x][1] == 0) {
+
118 x = 0;
+
119 return;
+
120 } // If there are no children, delete and return
+
121 // Otherwise, we need to rotate the sons and delete them
+
122 // recursively
+
123 int t = (priority[childs[x][0]] > priority[childs[x][1]]);
+
124 rotate(x, t);
+
125 _erase(x, k);
+
126 }
+
127 } else { // Find the target value based on BST properties
+
128 _erase(childs[x][key[x] < k], k);
+
129 }
+
130 update(x);
+
131 }
+
std::array< int, maxNode > key
Node identifier.
Definition treap.cpp:42
+
void rotate(int &x, int t)
Rotate without breaking the property of BST.
Definition treap.cpp:70
+
void update(int x)
Update the subtree size of the node.
Definition treap.cpp:62
+
std::array< std::array< int, 2 >, maxNode > childs
Definition treap.cpp:44
+
void _erase(int &x, int k)
Erase a value from the specified subtree (internal method)
Definition treap.cpp:111
+
std::array< int, maxNode > cnt
Maintains the subtree size for ranking query.
Definition treap.cpp:48
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ _get_k_th()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int data_structures::treap::Treap::_get_k_th (int & x,
int k 
)
+
+inline
+
+ +

Find the KTH largest value (internal method)

+
Parameters
+ + + +
xQuery the subtree of node x (Usually x=root)
kThe queried rank
+
+
+
Returns
The element ranked number k
+
138 {
+
139 if (k <= size[childs[x][0]]) {
+
140 return _get_k_th(childs[x][0], k);
+
141 }
+
142 k -= size[childs[x][0]] + cnt[x];
+
143 if (k <= 0) {
+
144 return key[x];
+
145 }
+
146 return _get_k_th(childs[x][1], k);
+
147 }
+
double k(double x)
Another test function.
Definition composite_simpson_rule.cpp:117
+
int _get_k_th(int &x, int k)
Find the KTH largest value (internal method)
Definition treap.cpp:138
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ _get_rank()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int data_structures::treap::Treap::_get_rank (int x,
int k 
)
+
+inline
+
+ +

Query the rank of specified element (internal method)

+
Parameters
+ + + +
xQuery the subtree of node x (Usually x=root)
kThe queried element
+
+
+
Returns
The rank of element k
+
154 {
+
155 if (!x) {
+
156 return 0;
+
157 }
+
158 if (k == key[x]) {
+
159 return size[childs[x][0]] + 1;
+
160 }
+
161 else if (k < key[x]) {
+
162 return _get_rank(childs[x][0], k);
+
163 }
+
164 else {
+
165 return size[childs[x][0]] + cnt[x] + _get_rank(childs[x][1], k);
+
166 }
+
167 }
+
int _get_rank(int x, int k)
Query the rank of specified element (internal method)
Definition treap.cpp:154
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ _insert()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void data_structures::treap::Treap::_insert (int & x,
int k 
)
+
+inline
+
+ +

Insert a value into the specified subtree (internal method)

+
Parameters
+ + + +
xInsert into the subtree of node x (Usually x=root)
kKey to insert
+
+
+
84 {
+
85 if (x) {
+
86 if (key[x] == k) {
+
87 cnt[x]++;
+
88 } // If the node already exists, the number of copies is ++
+
89 else {
+
90 int t = (key[x] < k); // Insert according to BST properties
+
91 _insert(childs[x][t], k);
+
92 // After insertion, the heap properties are retained by rotation
+
93 if (priority[childs[x][t]] < priority[x]) {
+
94 rotate(x, t);
+
95 }
+
96 }
+
97 } else { // Create a new node
+
98 x = treapCnt++;
+
99 key[x] = k;
+
100 cnt[x] = 1;
+
101 priority[x] = rand(); // Random priority
+
102 childs[x][0] = childs[x][1] = 0;
+
103 }
+
104 update(x);
+
105 }
+
T rand(T... args)
+
void _insert(int &x, int k)
Insert a value into the specified subtree (internal method)
Definition treap.cpp:84
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ erase()

+ +
+
+ + + + + +
+ + + + + + + + +
void data_structures::treap::Treap::erase (int k)
+
+inline
+
+ +

Erase element (External method)

+
Parameters
+ + +
kKey to erase
+
+
+
209{ _erase(root, k); }
+
int root
root of the treap
Definition treap.cpp:40
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ get_k_th()

+ +
+
+ + + + + +
+ + + + + + + + +
int data_structures::treap::Treap::get_k_th (int k)
+
+inline
+
+ +

Get the KTH largest value (External method)

+
Parameters
+ + +
kThe queried rank
+
+
+
Returns
The element ranked number x
+
215{ return _get_k_th(root, k); }
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ get_next()

+ +
+
+ + + + + +
+ + + + + + + + +
int data_structures::treap::Treap::get_next (int k)
+
+inline
+
+ +

Get the successor node of element k.

+
Parameters
+ + +
kThe queried element
+
+
+
Returns
The successor
+
189 {
+
190 int x = root, next = -1;
+
191 while (x) {
+
192 if (key[x] > k) {
+
193 next = key[x], x = childs[x][0];
+
194 } else {
+
195 x = childs[x][1];
+
196 }
+
197 }
+
198 return next;
+
199 }
+
T next(T... args)
+
+
+
+ +

◆ get_predecessor()

+ +
+
+ + + + + +
+ + + + + + + + +
int data_structures::treap::Treap::get_predecessor (int k)
+
+inline
+
+ +

Get the predecessor node of element k.

+
Parameters
+ + +
kThe queried element
+
+
+
Returns
The predecessor
+
173 {
+
174 int x = root, pre = -1;
+
175 while (x) {
+
176 if (key[x] < k) {
+
177 pre = key[x], x = childs[x][1];
+
178 } else {
+
179 x = childs[x][0];
+
180 }
+
181 }
+
182 return pre;
+
183 }
+
+
+
+ +

◆ get_rank()

+ +
+
+ + + + + +
+ + + + + + + + +
int data_structures::treap::Treap::get_rank (int k)
+
+inline
+
+ +

Get the rank of specified element (External method)

+
Parameters
+ + +
kThe queried element
+
+
+
Returns
The rank of element k
+
221{ return _get_rank(root, k); }
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ insert()

+ +
+
+ + + + + +
+ + + + + + + + +
void data_structures::treap::Treap::insert (int k)
+
+inline
+
+ +

Insert element (External method)

+
Parameters
+ + +
kKey to insert
+
+
+
204{ _insert(root, k); }
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ rotate()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void data_structures::treap::Treap::rotate (int & x,
int t 
)
+
+inline
+
+ +

Rotate without breaking the property of BST.

+
Parameters
+ + + +
xThe node to rotate
t0 represent left hand, while 1 right hand
+
+
+
70 {
+
71 int y = childs[x][t];
+
72 childs[x][t] = childs[y][1 - t];
+
73 childs[y][1 - t] = x;
+
74 // The rotation will only change itself and its son nodes
+
75 update(x);
+
76 update(y);
+
77 x = y;
+
78 }
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ update()

+ +
+
+ + + + + +
+ + + + + + + + +
void data_structures::treap::Treap::update (int x)
+
+inline
+
+ +

Update the subtree size of the node.

+
Parameters
+ + +
xThe node to update
+
+
+
62 {
+
63 size[x] = size[childs[x][0]] + cnt[x] + size[childs[x][1]];
+
64 }
+
+
+
+

Member Data Documentation

+ +

◆ childs

+ +
+
+ + + + +
std::array<std::array<int, 2>, maxNode> data_structures::treap::Treap::childs
+
+Initial value:
= {
+
{}}
+

[i][0] represents the left child of node i, and [i][1] represents the right

+ +
+
+ +

◆ cnt

+ +
+
+ + + + +
std::array<int, maxNode> data_structures::treap::Treap::cnt
+
+Initial value:
=
+
{}
+
+

Maintains the subtree size for ranking query.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+ + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap.js b/d5/d95/structdata__structures_1_1treap_1_1_treap.js new file mode 100644 index 000000000..ab2284bcd --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap.js @@ -0,0 +1,23 @@ +var structdata__structures_1_1treap_1_1_treap = +[ + [ "Treap", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683", null ], + [ "_erase", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887", null ], + [ "_get_k_th", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2", null ], + [ "_get_rank", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec", null ], + [ "_insert", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c", null ], + [ "erase", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469", null ], + [ "get_k_th", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69", null ], + [ "get_next", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4", null ], + [ "get_predecessor", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126", null ], + [ "get_rank", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039", null ], + [ "insert", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f", null ], + [ "rotate", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29", null ], + [ "update", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7", null ], + [ "childs", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f", null ], + [ "cnt", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919", null ], + [ "key", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04", null ], + [ "priority", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723", null ], + [ "root", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c", null ], + [ "size", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c", null ], + [ "treapCnt", "d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425", null ] +]; \ No newline at end of file diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.map b/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.map new file mode 100644 index 000000000..c499fe7d8 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.map @@ -0,0 +1,11 @@ + + + + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.md5 b/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.md5 new file mode 100644 index 000000000..392cf015e --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.md5 @@ -0,0 +1 @@ +1a46824a3e78caf6cff3506bdeee7918 \ No newline at end of file diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.svg new file mode 100644 index 000000000..b43ed2860 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.svg @@ -0,0 +1,179 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +data_structures::treap::Treap::insert + + +Node1 + + +data_structures::treap +::Treap::insert + + + + + +Node2 + + +data_structures::treap +::Treap::_insert + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +data_structures::treap +::Treap::rotate + + + + + +Node2->Node3 + + + + + + + + +Node4 + + +data_structures::treap +::Treap::update + + + + + +Node2->Node4 + + + + + + + + +Node3->Node4 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph_org.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph_org.svg new file mode 100644 index 000000000..5c31abc5c --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph_org.svg @@ -0,0 +1,97 @@ + + + + + + +data_structures::treap::Treap::insert + + +Node1 + + +data_structures::treap +::Treap::insert + + + + + +Node2 + + +data_structures::treap +::Treap::_insert + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +data_structures::treap +::Treap::rotate + + + + + +Node2->Node3 + + + + + + + + +Node4 + + +data_structures::treap +::Treap::update + + + + + +Node2->Node4 + + + + + + + + +Node3->Node4 + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.map b/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.map new file mode 100644 index 000000000..f94f54286 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.md5 b/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.md5 new file mode 100644 index 000000000..93e8fc517 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.md5 @@ -0,0 +1 @@ +6aea5124890c41a539bab76ffe58184c \ No newline at end of file diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.svg new file mode 100644 index 000000000..d2f6f10f0 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.svg @@ -0,0 +1,103 @@ + + + + + + + + + + + +data_structures::treap::Treap::_insert + + +Node1 + + +data_structures::treap +::Treap::_insert + + + + + +Node1->Node1 + + + + + + + + +Node2 + + +data_structures::treap +::Treap::rotate + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +data_structures::treap +::Treap::update + + + + + +Node1->Node3 + + + + + + + + +Node2->Node3 + + + + + + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph_org.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph_org.svg new file mode 100644 index 000000000..7aa909cf8 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph_org.svg @@ -0,0 +1,78 @@ + + + + + + +data_structures::treap::Treap::_insert + + +Node1 + + +data_structures::treap +::Treap::_insert + + + + + +Node1->Node1 + + + + + + + + +Node2 + + +data_structures::treap +::Treap::rotate + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +data_structures::treap +::Treap::update + + + + + +Node1->Node3 + + + + + + + + +Node2->Node3 + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.map b/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.map new file mode 100644 index 000000000..915be29d3 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.md5 b/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.md5 new file mode 100644 index 000000000..9befff215 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.md5 @@ -0,0 +1 @@ +141e105b296c4e1d000f3d879236f8f4 \ No newline at end of file diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.svg new file mode 100644 index 000000000..4d496db2d --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.svg @@ -0,0 +1,66 @@ + + + + + + + + + + + +data_structures::treap::Treap::rotate + + +Node1 + + +data_structures::treap +::Treap::rotate + + + + + +Node2 + + +data_structures::treap +::Treap::update + + + + + +Node1->Node2 + + + + + + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph_org.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph_org.svg new file mode 100644 index 000000000..972ef2c1b --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph_org.svg @@ -0,0 +1,41 @@ + + + + + + +data_structures::treap::Treap::rotate + + +Node1 + + +data_structures::treap +::Treap::rotate + + + + + +Node2 + + +data_structures::treap +::Treap::update + + + + + +Node1->Node2 + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.map b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.map new file mode 100644 index 000000000..3805639ca --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.md5 b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.md5 new file mode 100644 index 000000000..e2c6fbed7 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.md5 @@ -0,0 +1 @@ +d9b488a761e056d27c66b0767cddacd7 \ No newline at end of file diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.svg new file mode 100644 index 000000000..e815d59e4 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.svg @@ -0,0 +1,56 @@ + + + + + + + + + + + +data_structures::treap::Treap::_get_rank + + +Node1 + + +data_structures::treap +::Treap::_get_rank + + + + + +Node1->Node1 + + + + + + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph_org.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph_org.svg new file mode 100644 index 000000000..17ce8edb0 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph_org.svg @@ -0,0 +1,31 @@ + + + + + + +data_structures::treap::Treap::_get_rank + + +Node1 + + +data_structures::treap +::Treap::_get_rank + + + + + +Node1->Node1 + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.map b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.map new file mode 100644 index 000000000..11365b88c --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.map @@ -0,0 +1,11 @@ + + + + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.md5 b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.md5 new file mode 100644 index 000000000..0d0e17029 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.md5 @@ -0,0 +1 @@ +279d1efdd96b7a5e236640771ec79a21 \ No newline at end of file diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.svg new file mode 100644 index 000000000..511d7b1a9 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.svg @@ -0,0 +1,179 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +data_structures::treap::Treap::erase + + +Node1 + + +data_structures::treap +::Treap::erase + + + + + +Node2 + + +data_structures::treap +::Treap::_erase + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +data_structures::treap +::Treap::rotate + + + + + +Node2->Node3 + + + + + + + + +Node4 + + +data_structures::treap +::Treap::update + + + + + +Node2->Node4 + + + + + + + + +Node3->Node4 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph_org.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph_org.svg new file mode 100644 index 000000000..3fa0fddb7 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph_org.svg @@ -0,0 +1,97 @@ + + + + + + +data_structures::treap::Treap::erase + + +Node1 + + +data_structures::treap +::Treap::erase + + + + + +Node2 + + +data_structures::treap +::Treap::_erase + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +data_structures::treap +::Treap::rotate + + + + + +Node2->Node3 + + + + + + + + +Node4 + + +data_structures::treap +::Treap::update + + + + + +Node2->Node4 + + + + + + + + +Node3->Node4 + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.map b/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.map new file mode 100644 index 000000000..fee97374f --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.md5 b/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.md5 new file mode 100644 index 000000000..189703414 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.md5 @@ -0,0 +1 @@ +2137a5563e5e268f19d3f2b6cfd31946 \ No newline at end of file diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.svg new file mode 100644 index 000000000..0e8c66e19 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.svg @@ -0,0 +1,75 @@ + + + + + + + + + + + +data_structures::treap::Treap::get_k_th + + +Node1 + + +data_structures::treap +::Treap::get_k_th + + + + + +Node2 + + +data_structures::treap +::Treap::_get_k_th + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph_org.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph_org.svg new file mode 100644 index 000000000..96918aea0 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph_org.svg @@ -0,0 +1,50 @@ + + + + + + +data_structures::treap::Treap::get_k_th + + +Node1 + + +data_structures::treap +::Treap::get_k_th + + + + + +Node2 + + +data_structures::treap +::Treap::_get_k_th + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.map b/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.map new file mode 100644 index 000000000..02f5cc13c --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.md5 b/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.md5 new file mode 100644 index 000000000..b9f947382 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.md5 @@ -0,0 +1 @@ +4a12fb895227bd3b17723666a4988c25 \ No newline at end of file diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.svg new file mode 100644 index 000000000..41c08e7ff --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.svg @@ -0,0 +1,75 @@ + + + + + + + + + + + +data_structures::treap::Treap::get_rank + + +Node1 + + +data_structures::treap +::Treap::get_rank + + + + + +Node2 + + +data_structures::treap +::Treap::_get_rank + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph_org.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph_org.svg new file mode 100644 index 000000000..6ca799696 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph_org.svg @@ -0,0 +1,50 @@ + + + + + + +data_structures::treap::Treap::get_rank + + +Node1 + + +data_structures::treap +::Treap::get_rank + + + + + +Node2 + + +data_structures::treap +::Treap::_get_rank + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.map b/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.map new file mode 100644 index 000000000..f492e5bb1 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.md5 b/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.md5 new file mode 100644 index 000000000..a9cff07a4 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.md5 @@ -0,0 +1 @@ +701e836f7db03f3519f099c17f8566d0 \ No newline at end of file diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.svg new file mode 100644 index 000000000..e2b501bfa --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.svg @@ -0,0 +1,56 @@ + + + + + + + + + + + +data_structures::treap::Treap::_get_k_th + + +Node1 + + +data_structures::treap +::Treap::_get_k_th + + + + + +Node1->Node1 + + + + + + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph_org.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph_org.svg new file mode 100644 index 000000000..58f820c69 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph_org.svg @@ -0,0 +1,31 @@ + + + + + + +data_structures::treap::Treap::_get_k_th + + +Node1 + + +data_structures::treap +::Treap::_get_k_th + + + + + +Node1->Node1 + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.map b/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.map new file mode 100644 index 000000000..8ce0b6934 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.md5 b/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.md5 new file mode 100644 index 000000000..3f6810db4 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.md5 @@ -0,0 +1 @@ +24fe823850a2343f6112b4b25e58dc5d \ No newline at end of file diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.svg new file mode 100644 index 000000000..6f6a50ca2 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.svg @@ -0,0 +1,103 @@ + + + + + + + + + + + +data_structures::treap::Treap::_erase + + +Node1 + + +data_structures::treap +::Treap::_erase + + + + + +Node1->Node1 + + + + + + + + +Node2 + + +data_structures::treap +::Treap::rotate + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +data_structures::treap +::Treap::update + + + + + +Node1->Node3 + + + + + + + + +Node2->Node3 + + + + + + + + + + + + + diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph_org.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph_org.svg new file mode 100644 index 000000000..f34fd3936 --- /dev/null +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph_org.svg @@ -0,0 +1,78 @@ + + + + + + +data_structures::treap::Treap::_erase + + +Node1 + + +data_structures::treap +::Treap::_erase + + + + + +Node1->Node1 + + + + + + + + +Node2 + + +data_structures::treap +::Treap::rotate + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +data_structures::treap +::Treap::update + + + + + +Node1->Node3 + + + + + + + + +Node2->Node3 + + + + + + + + diff --git a/da/de6/treap_8cpp__incl.map b/da/de6/treap_8cpp__incl.map new file mode 100644 index 000000000..8c745e42a --- /dev/null +++ b/da/de6/treap_8cpp__incl.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/da/de6/treap_8cpp__incl.md5 b/da/de6/treap_8cpp__incl.md5 new file mode 100644 index 000000000..133f350a3 --- /dev/null +++ b/da/de6/treap_8cpp__incl.md5 @@ -0,0 +1 @@ +8eccd6d756ca12df3d1d31f78b2b8149 \ No newline at end of file diff --git a/da/de6/treap_8cpp__incl.svg b/da/de6/treap_8cpp__incl.svg new file mode 100644 index 000000000..057bd0902 --- /dev/null +++ b/da/de6/treap_8cpp__incl.svg @@ -0,0 +1,100 @@ + + + + + + + + + + + +data_structures/treap.cpp + + +Node1 + + +data_structures/treap.cpp + + + + + +Node2 + + +array + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +cassert + + + + + +Node1->Node3 + + + + + + + + +Node4 + + +iostream + + + + + +Node1->Node4 + + + + + + + + + + + + + diff --git a/da/de6/treap_8cpp__incl_org.svg b/da/de6/treap_8cpp__incl_org.svg new file mode 100644 index 000000000..100d327b4 --- /dev/null +++ b/da/de6/treap_8cpp__incl_org.svg @@ -0,0 +1,75 @@ + + + + + + +data_structures/treap.cpp + + +Node1 + + +data_structures/treap.cpp + + + + + +Node2 + + +array + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +cassert + + + + + +Node1->Node3 + + + + + + + + +Node4 + + +iostream + + + + + +Node1->Node4 + + + + + + + + diff --git a/df/ddb/structdata__structures_1_1treap_1_1_treap-members.html b/df/ddb/structdata__structures_1_1treap_1_1_treap-members.html new file mode 100644 index 000000000..21417ee3d --- /dev/null +++ b/df/ddb/structdata__structures_1_1treap_1_1_treap-members.html @@ -0,0 +1,135 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ 1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ +
+
data_structures::treap::Treap Member List
+
+
+ +

This is the complete list of members for data_structures::treap::Treap, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + +
_erase(int &x, int k)data_structures::treap::Treapinline
_get_k_th(int &x, int k)data_structures::treap::Treapinline
_get_rank(int x, int k)data_structures::treap::Treapinline
_insert(int &x, int k)data_structures::treap::Treapinline
childsdata_structures::treap::Treap
cntdata_structures::treap::Treap
erase(int k)data_structures::treap::Treapinline
get_k_th(int k)data_structures::treap::Treapinline
get_next(int k)data_structures::treap::Treapinline
get_predecessor(int k)data_structures::treap::Treapinline
get_rank(int k)data_structures::treap::Treapinline
insert(int k)data_structures::treap::Treapinline
keydata_structures::treap::Treap
prioritydata_structures::treap::Treap
rootdata_structures::treap::Treap
rotate(int &x, int t)data_structures::treap::Treapinline
sizedata_structures::treap::Treap
Treap()data_structures::treap::Treapinline
treapCntdata_structures::treap::Treap
update(int x)data_structures::treap::Treapinline
+
+ + + + diff --git a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html index 17f2bf006..075e5cbf2 100644 --- a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html +++ b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html @@ -166,6 +166,9 @@ Files  stack.hpp  This class specifies the basic operation on a stack as a linked list.
  + treap.cpp + A balanced binary search tree (BST) on the basis of binary search tree and heap: the Treap algorithm implementation.
 tree_234.cpp  A demo 2-3-4 tree implementation.
  diff --git a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js index 474ac062b..e7da12f9f 100644 --- a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js +++ b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js @@ -21,6 +21,7 @@ var dir_2e746e9d06bf2d8ff842208bcc6ebcfc = [ "skip_list.cpp", "d0/d5a/skip__list_8cpp.html", "d0/d5a/skip__list_8cpp" ], [ "sparse_table.cpp", "d6/d42/data__structures_2sparse__table_8cpp.html", "d6/d42/data__structures_2sparse__table_8cpp" ], [ "stack.hpp", "df/d47/stack_8hpp.html", "df/d47/stack_8hpp" ], + [ "treap.cpp", "d0/dd2/treap_8cpp.html", "d0/dd2/treap_8cpp" ], [ "tree_234.cpp", "db/dbc/tree__234_8cpp.html", "db/dbc/tree__234_8cpp" ], [ "trie_modern.cpp", "dc/d93/trie__modern_8cpp.html", "dc/d93/trie__modern_8cpp" ], [ "trie_tree.cpp", "d7/d83/trie__tree_8cpp.html", "d7/d83/trie__tree_8cpp" ], diff --git a/files.html b/files.html index bf7bc1312..9dfd9ba74 100644 --- a/files.html +++ b/files.html @@ -162,10 +162,11 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm  skip_list.cppData structure for fast searching and insertion in \(O(\log n)\) time  sparse_table.cppImplementation of Sparse Table for min() function  stack.hppThis class specifies the basic operation on a stack as a linked list - tree_234.cppA demo 2-3-4 tree implementation - trie_modern.cppA basic implementation of trie class to store only lower-case strings - trie_tree.cppImplementation of Trie data structure for English alphabets in small characters - trie_using_hashmap.cppImplementation of Trie data structure using HashMap for different characters and method for predicting words based on prefix + treap.cppA balanced binary search tree (BST) on the basis of binary search tree and heap: the Treap algorithm implementation + tree_234.cppA demo 2-3-4 tree implementation + trie_modern.cppA basic implementation of trie class to store only lower-case strings + trie_tree.cppImplementation of Trie data structure for English alphabets in small characters + trie_using_hashmap.cppImplementation of Trie data structure using HashMap for different characters and method for predicting words based on prefix   divide_and_conquer  karatsuba_algorithm_for_fast_multiplication.cppImplementation of the Karatsuba algorithm for fast multiplication   dynamic_programming diff --git a/functions.html b/functions.html index 965ac6b26..2a15ae821 100644 --- a/functions.html +++ b/functions.html @@ -103,6 +103,10 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
  • __detailed_single_prediction() : machine_learning::neural_network::NeuralNetwork
  • __get_integer_from_string() : uint128_t, uint256_t
  • _digits : large_number
  • +
  • _erase() : data_structures::treap::Treap
  • +
  • _get_k_th() : data_structures::treap::Treap
  • +
  • _get_rank() : data_structures::treap::Treap
  • +
  • _insert() : data_structures::treap::Treap
  • _itMedian : probability::windowed_median::WindowedMedian
  • _lez() : uint128_t, uint256_t
  • _mod : hash_chain
  • diff --git a/functions_c.html b/functions_c.html index 99f38b15a..9fbfbff7c 100644 --- a/functions_c.html +++ b/functions_c.html @@ -107,8 +107,10 @@ $(document).ready(function(){initNavTree('functions_c.html',''); initResizable()
  • char_to_int() : data_structures::trie
  • check_size_match() : machine_learning::adaline
  • children : data_structures::tree_234::Node, data_structures::trie_using_hashmap::Trie::Node
  • +
  • childs : data_structures::treap::Treap
  • CircularLinkedList() : operations_on_datastructures::circular_linked_list::CircularLinkedList
  • clear() : queue< ValueType >, stack< ValueType >
  • +
  • cnt : data_structures::treap::Treap
  • codec() : ciphers::HillCipher
  • comb() : data_structures::SegmentTree< T >
  • combine() : range_queries::heavy_light_decomposition::SG< X >
  • diff --git a/functions_e.html b/functions_e.html index e7dc16c79..1dae7b9a7 100644 --- a/functions_e.html +++ b/functions_e.html @@ -108,7 +108,7 @@ $(document).ready(function(){initNavTree('functions_e.html',''); initResizable()
  • enQueue() : queue< ValueType >
  • ensureNotEmpty() : queue< ValueType >
  • Entry() : double_hashing::Entry, linear_probing::Entry, quadratic_probing::Entry
  • -
  • erase() : data_structures::linked_list::list, operations_on_datastructures::circular_linked_list::CircularLinkedList
  • +
  • erase() : data_structures::linked_list::list, data_structures::treap::Treap, operations_on_datastructures::circular_linked_list::CircularLinkedList
  • eraseFromSorted() : probability::windowed_median::WindowedMedian
  • eta : machine_learning::adaline
  • evaluate() : machine_learning::neural_network::NeuralNetwork
  • diff --git a/functions_func.html b/functions_func.html index 822bd281f..aacfb7829 100644 --- a/functions_func.html +++ b/functions_func.html @@ -102,6 +102,10 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl

    - _ -

    diff --git a/functions_func_e.html b/functions_func_e.html index 4ebd7e180..b8dd6a38f 100644 --- a/functions_func_e.html +++ b/functions_func_e.html @@ -107,7 +107,7 @@ $(document).ready(function(){initNavTree('functions_func_e.html',''); initResiza
  • enQueue() : queue< ValueType >
  • ensureNotEmpty() : queue< ValueType >
  • Entry() : double_hashing::Entry, linear_probing::Entry, quadratic_probing::Entry
  • -
  • erase() : data_structures::linked_list::list, operations_on_datastructures::circular_linked_list::CircularLinkedList
  • +
  • erase() : data_structures::linked_list::list, data_structures::treap::Treap, operations_on_datastructures::circular_linked_list::CircularLinkedList
  • eraseFromSorted() : probability::windowed_median::WindowedMedian
  • evaluate() : machine_learning::neural_network::NeuralNetwork
  • evaluate_from_csv() : machine_learning::neural_network::NeuralNetwork
  • diff --git a/functions_func_g.html b/functions_func_g.html index c5081bffe..77b51fe50 100644 --- a/functions_func_g.html +++ b/functions_func_g.html @@ -116,9 +116,13 @@ $(document).ready(function(){initNavTree('functions_func_g.html',''); initResiza
  • get_elements_preorder() : binary_search_tree< T >
  • get_idx_char() : ciphers::HillCipher
  • get_inverse() : ciphers::HillCipher
  • +
  • get_k_th() : data_structures::treap::Treap
  • get_level_order() : operations_on_datastructures::reverse_binary_tree::BinaryTree
  • get_max() : dsu
  • get_min() : dsu
  • +
  • get_next() : data_structures::treap::Treap
  • +
  • get_predecessor() : data_structures::treap::Treap
  • +
  • get_rank() : data_structures::treap::Treap
  • get_size() : machine_learning::aystar_search::EightPuzzle< N >
  • get_state() : machine_learning::aystar_search::EightPuzzle< N >
  • get_XY_from_csv() : machine_learning::neural_network::NeuralNetwork
  • diff --git a/functions_func_i.html b/functions_func_i.html index d04bdc15b..ba4090350 100644 --- a/functions_func_i.html +++ b/functions_func_i.html @@ -105,9 +105,9 @@ $(document).ready(function(){initNavTree('functions_func_i.html',''); initResiza
  • Info() : machine_learning::aystar_search::AyStarSearch< Puzzle >::Info
  • init() : range_queries::heavy_light_decomposition::HLD< X >, range_queries::heavy_light_decomposition::Tree< X >
  • inOrderIterative() : others::iterative_tree_traversals::BinaryTree
  • -
  • insert() : binary_search_tree< T >, data_structures::linked_list::list, data_structures::list_array::list< N >
  • -
  • Insert() : data_structures::tree_234::Tree234
  • -
  • insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie, operations_on_datastructures::circular_linked_list::CircularLinkedList, operations_on_datastructures::reverse_binary_tree::BinaryTree
  • +
  • insert() : binary_search_tree< T >, data_structures::linked_list::list, data_structures::list_array::list< N >, data_structures::treap::Treap
  • +
  • Insert() : data_structures::tree_234::Tree234
  • +
  • insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie, operations_on_datastructures::circular_linked_list::CircularLinkedList, operations_on_datastructures::reverse_binary_tree::BinaryTree
  • Insert() : operations_on_datastructures::trie_operations::Tnode
  • insert() : probability::windowed_median::WindowedMedian, Trie
  • insertElement() : data_structures::SkipList
  • diff --git a/functions_func_r.html b/functions_func_r.html index 75cdcc767..51788c45d 100644 --- a/functions_func_r.html +++ b/functions_func_r.html @@ -117,6 +117,7 @@ $(document).ready(function(){initNavTree('functions_func_r.html',''); initResiza
  • right() : MinHeap
  • RightRotate() : data_structures::tree_234::Tree234
  • RootedTree() : graph::RootedTree
  • +
  • rotate() : data_structures::treap::Treap
  • runTests() : TestCases
  • diff --git a/functions_func_t.html b/functions_func_t.html index 01572353a..f20323dc2 100644 --- a/functions_func_t.html +++ b/functions_func_t.html @@ -112,6 +112,7 @@ $(document).ready(function(){initNavTree('functions_func_t.html',''); initResiza
  • traverse_inorder() : binary_search_tree< T >
  • traverse_postorder() : binary_search_tree< T >
  • traverse_preorder() : binary_search_tree< T >
  • +
  • Treap() : data_structures::treap::Treap
  • Tree() : range_queries::heavy_light_decomposition::Tree< X >
  • trie() : data_structures::trie
  • Trie() : data_structures::trie_using_hashmap::Trie, Trie
  • diff --git a/functions_func_u.html b/functions_func_u.html index ea5da23ed..f915a697f 100644 --- a/functions_func_u.html +++ b/functions_func_u.html @@ -102,9 +102,9 @@ $(document).ready(function(){initNavTree('functions_func_u.html',''); initResiza

    - u -

    diff --git a/functions_g.html b/functions_g.html index 678fe4ac0..ec7176301 100644 --- a/functions_g.html +++ b/functions_g.html @@ -116,9 +116,13 @@ $(document).ready(function(){initNavTree('functions_g.html',''); initResizable()
  • get_elements_preorder() : binary_search_tree< T >
  • get_idx_char() : ciphers::HillCipher
  • get_inverse() : ciphers::HillCipher
  • +
  • get_k_th() : data_structures::treap::Treap
  • get_level_order() : operations_on_datastructures::reverse_binary_tree::BinaryTree
  • get_max() : dsu
  • get_min() : dsu
  • +
  • get_next() : data_structures::treap::Treap
  • +
  • get_predecessor() : data_structures::treap::Treap
  • +
  • get_rank() : data_structures::treap::Treap
  • get_size() : machine_learning::aystar_search::EightPuzzle< N >
  • get_state() : machine_learning::aystar_search::EightPuzzle< N >
  • get_XY_from_csv() : machine_learning::neural_network::NeuralNetwork
  • diff --git a/functions_i.html b/functions_i.html index 312ce5943..baf667c6f 100644 --- a/functions_i.html +++ b/functions_i.html @@ -106,9 +106,9 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
  • Info : machine_learning::aystar_search::AyStarSearch< Puzzle >, machine_learning::aystar_search::AyStarSearch< Puzzle >::Info
  • init() : range_queries::heavy_light_decomposition::HLD< X >, range_queries::heavy_light_decomposition::Tree< X >
  • inOrderIterative() : others::iterative_tree_traversals::BinaryTree
  • -
  • insert() : binary_search_tree< T >, data_structures::linked_list::list, data_structures::list_array::list< N >
  • -
  • Insert() : data_structures::tree_234::Tree234
  • -
  • insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie, operations_on_datastructures::circular_linked_list::CircularLinkedList, operations_on_datastructures::reverse_binary_tree::BinaryTree
  • +
  • insert() : binary_search_tree< T >, data_structures::linked_list::list, data_structures::list_array::list< N >, data_structures::treap::Treap
  • +
  • Insert() : data_structures::tree_234::Tree234
  • +
  • insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie, operations_on_datastructures::circular_linked_list::CircularLinkedList, operations_on_datastructures::reverse_binary_tree::BinaryTree
  • Insert() : operations_on_datastructures::trie_operations::Tnode
  • insert() : probability::windowed_median::WindowedMedian, Trie
  • insertElement() : data_structures::SkipList
  • diff --git a/functions_k.html b/functions_k.html index 590b535eb..270dff48b 100644 --- a/functions_k.html +++ b/functions_k.html @@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('functions_k.html',''); initResizable()
    Here is a list of all documented class members with links to the class documentation for each member:

    - k -

    diff --git a/functions_p.html b/functions_p.html index fd053906f..bd37fb8e0 100644 --- a/functions_p.html +++ b/functions_p.html @@ -121,6 +121,7 @@ $(document).ready(function(){initNavTree('functions_p.html',''); initResizable()
  • print() : operations_on_datastructures::circular_linked_list::CircularLinkedList, operations_on_datastructures::reverse_binary_tree::BinaryTree
  • PrintNode() : data_structures::tree_234::Tree234
  • printResult() : FCFS< S, T, E >
  • +
  • priority : data_structures::treap::Treap
  • probability_density() : probability::geometric_dist::geometric_distribution
  • psucc : data_structures::linked_list::link
  • ptrs : range_queries::perSegTree
  • diff --git a/functions_r.html b/functions_r.html index 0358144a9..c2e7d2939 100644 --- a/functions_r.html +++ b/functions_r.html @@ -118,10 +118,11 @@ $(document).ready(function(){initNavTree('functions_r.html',''); initResizable()
  • reverseList() : data_structures::linked_list::list
  • right : binary_search_tree< T >::bst_node, MinHeap, operations_on_datastructures::inorder_traversal_of_bst::Node, operations_on_datastructures::reverse_binary_tree::Node, others::iterative_tree_traversals::Node, others::recursive_tree_traversals::Node, range_queries::perSegTree::Node
  • RightRotate() : data_structures::tree_234::Tree234
  • -
  • root : graph::RootedTree, operations_on_datastructures::circular_linked_list::CircularLinkedList, operations_on_datastructures::reverse_binary_tree::BinaryTree
  • +
  • root : data_structures::treap::Treap, graph::RootedTree, operations_on_datastructures::circular_linked_list::CircularLinkedList, operations_on_datastructures::reverse_binary_tree::BinaryTree
  • root_ : binary_search_tree< T >, data_structures::tree_234::Tree234
  • root_node : data_structures::trie_using_hashmap::Trie
  • RootedTree() : graph::RootedTree
  • +
  • rotate() : data_structures::treap::Treap
  • runTests() : TestCases
  • diff --git a/functions_s.html b/functions_s.html index fce987aaa..265b90ef8 100644 --- a/functions_s.html +++ b/functions_s.html @@ -122,7 +122,7 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
  • show() : data_structures::list_array::list< N >
  • side : graph::is_graph_bipartite::Graph
  • single_predict() : machine_learning::neural_network::NeuralNetwork
  • -
  • size() : binary_search_tree< T >, data_structures::Bitset, data_structures::SegmentTree< T >, data_structures::stack_using_queue::Stack, divide_and_conquer::strassens_multiplication::Matrix< T, typename >, dsu, range_queries::perSegTree, stack< ValueType >
  • +
  • size() : binary_search_tree< T >, data_structures::Bitset, data_structures::SegmentTree< T >, data_structures::stack_using_queue::Stack, data_structures::treap::Treap, divide_and_conquer::strassens_multiplication::Matrix< T, typename >, dsu, range_queries::perSegTree, stack< ValueType >
  • size_ : binary_search_tree< T >
  • SkipList() : data_structures::SkipList
  • slice() : divide_and_conquer::strassens_multiplication::Matrix< T, typename >
  • diff --git a/functions_t.html b/functions_t.html index 48f25006a..833057cb0 100644 --- a/functions_t.html +++ b/functions_t.html @@ -121,6 +121,8 @@ $(document).ready(function(){initNavTree('functions_t.html',''); initResizable()
  • traverse_inorder() : binary_search_tree< T >
  • traverse_postorder() : binary_search_tree< T >
  • traverse_preorder() : binary_search_tree< T >
  • +
  • Treap() : data_structures::treap::Treap
  • +
  • treapCnt : data_structures::treap::Treap
  • Tree() : range_queries::heavy_light_decomposition::Tree< X >
  • trie() : data_structures::trie
  • Trie() : data_structures::trie_using_hashmap::Trie, Trie
  • diff --git a/functions_u.html b/functions_u.html index 45c38a7db..16eda2343 100644 --- a/functions_u.html +++ b/functions_u.html @@ -102,10 +102,10 @@ $(document).ready(function(){initNavTree('functions_u.html',''); initResizable()

    - u -

    diff --git a/functions_vars.html b/functions_vars.html index f48f75877..ebd1c5d2d 100644 --- a/functions_vars.html +++ b/functions_vars.html @@ -129,6 +129,8 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
  • cache : others::lru_cache::LRUCache
  • capacity : MinHeap
  • children : data_structures::tree_234::Node, data_structures::trie_using_hashmap::Trie::Node
  • +
  • childs : data_structures::treap::Treap
  • +
  • cnt : data_structures::treap::Treap
  • count : data_structures::tree_234::Node
  • current_size : data_structures::stack_using_queue::Stack
  • @@ -182,7 +184,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl

    - k -

    @@ -221,6 +223,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
  • pair_u : graph::HKGraph
  • pair_v : graph::HKGraph
  • parent : graph::RootedTree
  • +
  • priority : data_structures::treap::Treap
  • psucc : data_structures::linked_list::link
  • ptrs : range_queries::perSegTree
  • pvalue : data_structures::linked_list::link
  • @@ -237,7 +240,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
  • rear : data_structures::queue_using_array::Queue_Array
  • res : backtracking::generate_parentheses
  • right : binary_search_tree< T >::bst_node, operations_on_datastructures::inorder_traversal_of_bst::Node, operations_on_datastructures::reverse_binary_tree::Node, others::iterative_tree_traversals::Node, others::recursive_tree_traversals::Node, range_queries::perSegTree::Node
  • -
  • root : graph::RootedTree, operations_on_datastructures::circular_linked_list::CircularLinkedList, operations_on_datastructures::reverse_binary_tree::BinaryTree
  • +
  • root : data_structures::treap::Treap, graph::RootedTree, operations_on_datastructures::circular_linked_list::CircularLinkedList, operations_on_datastructures::reverse_binary_tree::BinaryTree
  • root_ : binary_search_tree< T >, data_structures::tree_234::Tree234
  • root_node : data_structures::trie_using_hashmap::Trie
  • @@ -250,7 +253,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
  • set : data_structures::BloomFilter< T >
  • setSize : dsu
  • side : graph::is_graph_bipartite::Graph
  • -
  • size : data_structures::SegmentTree< T >, stack< ValueType >
  • +
  • size : data_structures::SegmentTree< T >, data_structures::treap::Treap, stack< ValueType >
  • size_ : binary_search_tree< T >
  • sret_init : range_queries::heavy_light_decomposition::SG< X >
  • ST : data_structures::sparse_table::Sparse_table
  • @@ -270,6 +273,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
  • t_size : range_queries::heavy_light_decomposition::Tree< X >
  • t_val : range_queries::heavy_light_decomposition::Tree< X >
  • top : tower
  • +
  • treapCnt : data_structures::treap::Treap
  • diff --git a/globals_func_i.html b/globals_func_i.html index 783077489..7ea75fe1e 100644 --- a/globals_func_i.html +++ b/globals_func_i.html @@ -108,8 +108,8 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
  • InterpolationSearch() : interpolation_search2.cpp
  • is_happy() : happy_number.cpp
  • is_square() : ordinary_least_squares_regressor.cpp
  • -
  • isPrime() : modular_inverse_fermat_little_theorem.cpp
  • IsPrime() : primality_test.cpp
  • +
  • isPrime() : modular_inverse_fermat_little_theorem.cpp
  • it_ternary_search() : ternary_search.cpp
  • diff --git a/globals_func_m.html b/globals_func_m.html index 204cf52ac..5a0285ad5 100644 --- a/globals_func_m.html +++ b/globals_func_m.html @@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
    Here is a list of all documented functions with links to the documentation:

    - m -