diff options
author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-15 05:46:17 +0000 |
---|---|---|
committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-15 05:46:17 +0000 |
commit | 85adc697d2ec2a379ce6d721f0419ae5df3abdb6 (patch) | |
tree | 265f329bc4544c6f11a27ac3fd6022f593a10c11 /test/gdb/src/segment_tree.cpp | |
parent | Initial commit. (diff) | |
download | mdds-upstream.tar.xz mdds-upstream.zip |
Adding upstream version 2.1.1.upstream/2.1.1upstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'test/gdb/src/segment_tree.cpp')
-rw-r--r-- | test/gdb/src/segment_tree.cpp | 49 |
1 files changed, 49 insertions, 0 deletions
diff --git a/test/gdb/src/segment_tree.cpp b/test/gdb/src/segment_tree.cpp new file mode 100644 index 0000000..7d45e10 --- /dev/null +++ b/test/gdb/src/segment_tree.cpp @@ -0,0 +1,49 @@ +/* Test code for mdds::segment_tree. + + This file is part of mdds. + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see <http://www.gnu.org/licenses/>. */ + +#include <string> + +#include <mdds/segment_tree.hpp> + +void stop(); + +using std::string; + +using mdds::segment_tree; + +void test_segment_tree() +{ + segment_tree<int, int> empty_st; + + segment_tree<int, int> st_int; + st_int.insert(0, 10, 1); + st_int.insert(5, 20, 2); + st_int.insert(40, 50, 3); + st_int.insert(-10, 20, 0); + + segment_tree<int, string> st_string; + st_string.insert(20, 30, "My hovercraft is full of eels"); + + st_int.build_tree(); + auto search_none = st_int.search(25); + auto search_one = st_int.search(42); + auto search_more = st_int.search(8); + + stop(); +} + +// vim: set shiftwidth=4 softtabstop=4 expandtab: |