Adding upstream version 2.1.1.upstream/2.1.1upstream

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>

3 files changed, 2140 insertions, 0 deletions

diff --git a/test/segment_tree/Makefile.am b/test/segment_tree/Makefile.am
new file mode 100644
index 0000000..b4927a7
--- /dev/null
+++ b/test/segment_tree/Makefile.am
@@ -0,0 +1,14 @@
+AM_CPPFLAGS = \
+	-I$(top_srcdir)/include \
+	-I$(top_srcdir)/test/include \
+	$(CXXFLAGS_UNITTESTS)
+
+check_PROGRAMS = test-main
+
+test_main_SOURCES = \
+	test_main.cpp \
+	$(top_srcdir)/test/test_global.cpp
+
+TESTS = test-main
+
+@VALGRIND_CHECK_RULES@
diff --git a/test/segment_tree/Makefile.in b/test/segment_tree/Makefile.in
new file mode 100644
index 0000000..97cc373
--- /dev/null
+++ b/test/segment_tree/Makefile.in
@@ -0,0 +1,990 @@
+# Makefile.in generated by automake 1.16.5 from Makefile.am.
+# @configure_input@
+
+# Copyright (C) 1994-2021 Free Software Foundation, Inc.
+
+# This Makefile.in is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
+# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+# PARTICULAR PURPOSE.
+
+@SET_MAKE@
+VPATH = @srcdir@
+am__is_gnu_make = { \
+  if test -z '$(MAKELEVEL)'; then \
+    false; \
+  elif test -n '$(MAKE_HOST)'; then \
+    true; \
+  elif test -n '$(MAKE_VERSION)' && test -n '$(CURDIR)'; then \
+    true; \
+  else \
+    false; \
+  fi; \
+}
+am__make_running_with_option = \
+  case $${target_option-} in \
+      ?) ;; \
+      *) echo "am__make_running_with_option: internal error: invalid" \
+              "target option '$${target_option-}' specified" >&2; \
+         exit 1;; \
+  esac; \
+  has_opt=no; \
+  sane_makeflags=$$MAKEFLAGS; \
+  if $(am__is_gnu_make); then \
+    sane_makeflags=$$MFLAGS; \
+  else \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        bs=\\; \
+        sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \
+          | sed "s/$$bs$$bs[$$bs $$bs	]*//g"`;; \
+    esac; \
+  fi; \
+  skip_next=no; \
+  strip_trailopt () \
+  { \
+    flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \
+  }; \
+  for flg in $$sane_makeflags; do \
+    test $$skip_next = yes && { skip_next=no; continue; }; \
+    case $$flg in \
+      *=*|--*) continue;; \
+        -*I) strip_trailopt 'I'; skip_next=yes;; \
+      -*I?*) strip_trailopt 'I';; \
+        -*O) strip_trailopt 'O'; skip_next=yes;; \
+      -*O?*) strip_trailopt 'O';; \
+        -*l) strip_trailopt 'l'; skip_next=yes;; \
+      -*l?*) strip_trailopt 'l';; \
+      -[dEDm]) skip_next=yes;; \
+      -[JT]) skip_next=yes;; \
+    esac; \
+    case $$flg in \
+      *$$target_option*) has_opt=yes; break;; \
+    esac; \
+  done; \
+  test $$has_opt = yes
+am__make_dryrun = (target_option=n; $(am__make_running_with_option))
+am__make_keepgoing = (target_option=k; $(am__make_running_with_option))
+pkgdatadir = $(datadir)/@PACKAGE@
+pkgincludedir = $(includedir)/@PACKAGE@
+pkglibdir = $(libdir)/@PACKAGE@
+pkglibexecdir = $(libexecdir)/@PACKAGE@
+am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
+install_sh_DATA = $(install_sh) -c -m 644
+install_sh_PROGRAM = $(install_sh) -c
+install_sh_SCRIPT = $(install_sh) -c
+INSTALL_HEADER = $(INSTALL_DATA)
+transform = $(program_transform_name)
+NORMAL_INSTALL = :
+PRE_INSTALL = :
+POST_INSTALL = :
+NORMAL_UNINSTALL = :
+PRE_UNINSTALL = :
+POST_UNINSTALL = :
+check_PROGRAMS = test-main$(EXEEXT)
+TESTS = test-main$(EXEEXT)
+subdir = test/segment_tree
+ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
+am__aclocal_m4_deps = $(top_srcdir)/m4/ax_cxx_compile_stdcxx.m4 \
+	$(top_srcdir)/m4/ax_cxx_compile_stdcxx_17.m4 \
+	$(top_srcdir)/m4/m4_ax_valgrind_check.m4 \
+	$(top_srcdir)/configure.ac
+am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
+	$(ACLOCAL_M4)
+DIST_COMMON = $(srcdir)/Makefile.am $(am__DIST_COMMON)
+mkinstalldirs = $(install_sh) -d
+CONFIG_CLEAN_FILES =
+CONFIG_CLEAN_VPATH_FILES =
+am__dirstamp = $(am__leading_dot)dirstamp
+am_test_main_OBJECTS = test_main.$(OBJEXT) \
+	$(top_builddir)/test/test_global.$(OBJEXT)
+test_main_OBJECTS = $(am_test_main_OBJECTS)
+test_main_LDADD = $(LDADD)
+AM_V_P = $(am__v_P_@AM_V@)
+am__v_P_ = $(am__v_P_@AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_@AM_V@)
+am__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_@AM_V@)
+am__v_at_ = $(am__v_at_@AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
+DEFAULT_INCLUDES = -I.@am__isrc@
+depcomp = $(SHELL) $(top_srcdir)/depcomp
+am__maybe_remake_depfiles = depfiles
+am__depfiles_remade = $(top_builddir)/test/$(DEPDIR)/test_global.Po \
+	./$(DEPDIR)/test_main.Po
+am__mv = mv -f
+CXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \
+	$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)
+AM_V_CXX = $(am__v_CXX_@AM_V@)
+am__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@)
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
+CXXLD = $(CXX)
+CXXLINK = $(CXXLD) $(AM_CXXFLAGS) $(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) \
+	-o $@
+AM_V_CXXLD = $(am__v_CXXLD_@AM_V@)
+am__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@)
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
+SOURCES = $(test_main_SOURCES)
+DIST_SOURCES = $(test_main_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
+am__extra_recursive_targets = check-valgrind-recursive \
+	check-valgrind-memcheck-recursive \
+	check-valgrind-helgrind-recursive check-valgrind-drd-recursive \
+	check-valgrind-sgcheck-recursive
+am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)
+# Read a list of newline-separated strings from the standard input,
+# and print each of them once, without duplicates.  Input order is
+# *not* preserved.
+am__uniquify_input = $(AWK) '\
+  BEGIN { nonempty = 0; } \
+  { items[$$0] = 1; nonempty = 1; } \
+  END { if (nonempty) { for (i in items) print i; }; } \
+'
+# Make sure the list of sources is unique.  This is necessary because,
+# e.g., the same source file might be shared among _SOURCES variables
+# for different programs/libraries.
+am__define_uniq_tagged_files = \
+  list='$(am__tagged_files)'; \
+  unique=`for i in $$list; do \
+    if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
+  done | $(am__uniquify_input)`
+am__tty_colors_dummy = \
+  mgn= red= grn= lgn= blu= brg= std=; \
+  am__color_tests=no
+am__tty_colors = { \
+  $(am__tty_colors_dummy); \
+  if test "X$(AM_COLOR_TESTS)" = Xno; then \
+    am__color_tests=no; \
+  elif test "X$(AM_COLOR_TESTS)" = Xalways; then \
+    am__color_tests=yes; \
+  elif test "X$$TERM" != Xdumb && { test -t 1; } 2>/dev/null; then \
+    am__color_tests=yes; \
+  fi; \
+  if test $$am__color_tests = yes; then \
+    red=''; \
+    grn=''; \
+    lgn=''; \
+    blu=''; \
+    mgn=''; \
+    brg=''; \
+    std=''; \
+  fi; \
+}
+am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
+am__vpath_adj = case $$p in \
+    $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
+    *) f=$$p;; \
+  esac;
+am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;
+am__install_max = 40
+am__nobase_strip_setup = \
+  srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'`
+am__nobase_strip = \
+  for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||"
+am__nobase_list = $(am__nobase_strip_setup); \
+  for p in $$list; do echo "$$p $$p"; done | \
+  sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \
+  $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \
+    if (++n[$$2] == $(am__install_max)) \
+      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \
+    END { for (dir in files) print dir, files[dir] }'
+am__base_list = \
+  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \
+  sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g'
+am__uninstall_files_from_dir = { \
+  test -z "$$files" \
+    || { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \
+    || { echo " ( cd '$$dir' && rm -f" $$files ")"; \
+         $(am__cd) "$$dir" && rm -f $$files; }; \
+  }
+am__recheck_rx = ^[ 	]*:recheck:[ 	]*
+am__global_test_result_rx = ^[ 	]*:global-test-result:[ 	]*
+am__copy_in_global_log_rx = ^[ 	]*:copy-in-global-log:[ 	]*
+# A command that, given a newline-separated list of test names on the
+# standard input, print the name of the tests that are to be re-run
+# upon "make recheck".
+am__list_recheck_tests = $(AWK) '{ \
+  recheck = 1; \
+  while ((rc = (getline line < ($$0 ".trs"))) != 0) \
+    { \
+      if (rc < 0) \
+        { \
+          if ((getline line2 < ($$0 ".log")) < 0) \
+	    recheck = 0; \
+          break; \
+        } \
+      else if (line ~ /$(am__recheck_rx)[nN][Oo]/) \
+        { \
+          recheck = 0; \
+          break; \
+        } \
+      else if (line ~ /$(am__recheck_rx)[yY][eE][sS]/) \
+        { \
+          break; \
+        } \
+    }; \
+  if (recheck) \
+    print $$0; \
+  close ($$0 ".trs"); \
+  close ($$0 ".log"); \
+}'
+# A command that, given a newline-separated list of test names on the
+# standard input, create the global log from their .trs and .log files.
+am__create_global_log = $(AWK) ' \
+function fatal(msg) \
+{ \
+  print "fatal: making $@: " msg | "cat >&2"; \
+  exit 1; \
+} \
+function rst_section(header) \
+{ \
+  print header; \
+  len = length(header); \
+  for (i = 1; i <= len; i = i + 1) \
+    printf "="; \
+  printf "\n\n"; \
+} \
+{ \
+  copy_in_global_log = 1; \
+  global_test_result = "RUN"; \
+  while ((rc = (getline line < ($$0 ".trs"))) != 0) \
+    { \
+      if (rc < 0) \
+         fatal("failed to read from " $$0 ".trs"); \
+      if (line ~ /$(am__global_test_result_rx)/) \
+        { \
+          sub("$(am__global_test_result_rx)", "", line); \
+          sub("[ 	]*$$", "", line); \
+          global_test_result = line; \
+        } \
+      else if (line ~ /$(am__copy_in_global_log_rx)[nN][oO]/) \
+        copy_in_global_log = 0; \
+    }; \
+  if (copy_in_global_log) \
+    { \
+      rst_section(global_test_result ": " $$0); \
+      while ((rc = (getline line < ($$0 ".log"))) != 0) \
+      { \
+        if (rc < 0) \
+          fatal("failed to read from " $$0 ".log"); \
+        print line; \
+      }; \
+      printf "\n"; \
+    }; \
+  close ($$0 ".trs"); \
+  close ($$0 ".log"); \
+}'
+# Restructured Text title.
+am__rst_title = { sed 's/.*/   &   /;h;s/./=/g;p;x;s/ *$$//;p;g' && echo; }
+# Solaris 10 'make', and several other traditional 'make' implementations,
+# pass "-e" to $(SHELL), and POSIX 2008 even requires this.  Work around it
+# by disabling -e (using the XSI extension "set +e") if it's set.
+am__sh_e_setup = case $$- in *e*) set +e;; esac
+# Default flags passed to test drivers.
+am__common_driver_flags = \
+  --color-tests "$$am__color_tests" \
+  --enable-hard-errors "$$am__enable_hard_errors" \
+  --expect-failure "$$am__expect_failure"
+# To be inserted before the command running the test.  Creates the
+# directory for the log if needed.  Stores in $dir the directory
+# containing $f, in $tst the test, in $log the log.  Executes the
+# developer- defined test setup AM_TESTS_ENVIRONMENT (if any), and
+# passes TESTS_ENVIRONMENT.  Set up options for the wrapper that
+# will run the test scripts (or their associated LOG_COMPILER, if
+# thy have one).
+am__check_pre = \
+$(am__sh_e_setup);					\
+$(am__vpath_adj_setup) $(am__vpath_adj)			\
+$(am__tty_colors);					\
+srcdir=$(srcdir); export srcdir;			\
+case "$@" in						\
+  */*) am__odir=`echo "./$@" | sed 's|/[^/]*$$||'`;;	\
+    *) am__odir=.;; 					\
+esac;							\
+test "x$$am__odir" = x"." || test -d "$$am__odir" 	\
+  || $(MKDIR_P) "$$am__odir" || exit $$?;		\
+if test -f "./$$f"; then dir=./;			\
+elif test -f "$$f"; then dir=;				\
+else dir="$(srcdir)/"; fi;				\
+tst=$$dir$$f; log='$@'; 				\
+if test -n '$(DISABLE_HARD_ERRORS)'; then		\
+  am__enable_hard_errors=no; 				\
+else							\
+  am__enable_hard_errors=yes; 				\
+fi; 							\
+case " $(XFAIL_TESTS) " in				\
+  *[\ \	]$$f[\ \	]* | *[\ \	]$$dir$$f[\ \	]*) \
+    am__expect_failure=yes;;				\
+  *)							\
+    am__expect_failure=no;;				\
+esac; 							\
+$(AM_TESTS_ENVIRONMENT) $(TESTS_ENVIRONMENT)
+# A shell command to get the names of the tests scripts with any registered
+# extension removed (i.e., equivalently, the names of the test logs, with
+# the '.log' extension removed).  The result is saved in the shell variable
+# '$bases'.  This honors runtime overriding of TESTS and TEST_LOGS.  Sadly,
+# we cannot use something simpler, involving e.g., "$(TEST_LOGS:.log=)",
+# since that might cause problem with VPATH rewrites for suffix-less tests.
+# See also 'test-harness-vpath-rewrite.sh' and 'test-trs-basic.sh'.
+am__set_TESTS_bases = \
+  bases='$(TEST_LOGS)'; \
+  bases=`for i in $$bases; do echo $$i; done | sed 's/\.log$$//'`; \
+  bases=`echo $$bases`
+AM_TESTSUITE_SUMMARY_HEADER = ' for $(PACKAGE_STRING)'
+RECHECK_LOGS = $(TEST_LOGS)
+AM_RECURSIVE_TARGETS = check recheck
+TEST_SUITE_LOG = test-suite.log
+TEST_EXTENSIONS = @EXEEXT@ .test
+LOG_DRIVER = $(SHELL) $(top_srcdir)/test-driver
+LOG_COMPILE = $(LOG_COMPILER) $(AM_LOG_FLAGS) $(LOG_FLAGS)
+am__set_b = \
+  case '$@' in \
+    */*) \
+      case '$*' in \
+        */*) b='$*';; \
+          *) b=`echo '$@' | sed 's/\.log$$//'`; \
+       esac;; \
+    *) \
+      b='$*';; \
+  esac
+am__test_logs1 = $(TESTS:=.log)
+am__test_logs2 = $(am__test_logs1:@EXEEXT@.log=.log)
+TEST_LOGS = $(am__test_logs2:.test.log=.log)
+TEST_LOG_DRIVER = $(SHELL) $(top_srcdir)/test-driver
+TEST_LOG_COMPILE = $(TEST_LOG_COMPILER) $(AM_TEST_LOG_FLAGS) \
+	$(TEST_LOG_FLAGS)
+am__DIST_COMMON = $(srcdir)/Makefile.in $(top_srcdir)/depcomp \
+	$(top_srcdir)/test-driver
+DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
+ACLOCAL = @ACLOCAL@
+AMTAR = @AMTAR@
+AM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@
+API_VERSION = @API_VERSION@
+AUTOCONF = @AUTOCONF@
+AUTOHEADER = @AUTOHEADER@
+AUTOMAKE = @AUTOMAKE@
+AWK = @AWK@
+CC = @CC@
+CCDEPMODE = @CCDEPMODE@
+CFLAGS = @CFLAGS@
+CPPFLAGS = @CPPFLAGS@
+CPPFLAGS_NODEBUG = @CPPFLAGS_NODEBUG@
+CSCOPE = @CSCOPE@
+CTAGS = @CTAGS@
+CXX = @CXX@
+CXXDEPMODE = @CXXDEPMODE@
+CXXFLAGS = @CXXFLAGS@
+CXXFLAGS_UNITTESTS = @CXXFLAGS_UNITTESTS@
+CYGPATH_W = @CYGPATH_W@
+DEFS = @DEFS@
+DEPDIR = @DEPDIR@
+DOXYGEN = @DOXYGEN@
+ECHO_C = @ECHO_C@
+ECHO_N = @ECHO_N@
+ECHO_T = @ECHO_T@
+ENABLE_VALGRIND_drd = @ENABLE_VALGRIND_drd@
+ENABLE_VALGRIND_helgrind = @ENABLE_VALGRIND_helgrind@
+ENABLE_VALGRIND_memcheck = @ENABLE_VALGRIND_memcheck@
+ENABLE_VALGRIND_sgcheck = @ENABLE_VALGRIND_sgcheck@
+ETAGS = @ETAGS@
+EXEEXT = @EXEEXT@
+EXPECT = @EXPECT@
+GDB = @GDB@
+HAVE_CXX17 = @HAVE_CXX17@
+INCDIR = @INCDIR@
+INSTALL = @INSTALL@
+INSTALL_DATA = @INSTALL_DATA@
+INSTALL_PROGRAM = @INSTALL_PROGRAM@
+INSTALL_SCRIPT = @INSTALL_SCRIPT@
+INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
+LDFLAGS = @LDFLAGS@
+LIBOBJS = @LIBOBJS@
+LIBS = @LIBS@
+LTLIBOBJS = @LTLIBOBJS@
+MAINT = @MAINT@
+MAKEINFO = @MAKEINFO@
+MISCDIR = @MISCDIR@
+MKDIR_P = @MKDIR_P@
+OBJDIR = @OBJDIR@
+OBJEXT = @OBJEXT@
+PACKAGE = @PACKAGE@
+PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
+PACKAGE_NAME = @PACKAGE_NAME@
+PACKAGE_STRING = @PACKAGE_STRING@
+PACKAGE_TARNAME = @PACKAGE_TARNAME@
+PACKAGE_URL = @PACKAGE_URL@
+PACKAGE_VERSION = @PACKAGE_VERSION@
+PATH_SEPARATOR = @PATH_SEPARATOR@
+QUICKCHECKDIR = @QUICKCHECKDIR@
+RUNTEST_BIN = @RUNTEST_BIN@
+SET_MAKE = @SET_MAKE@
+SHELL = @SHELL@
+SPHINX = @SPHINX@
+STRIP = @STRIP@
+VALGRIND = @VALGRIND@
+VALGRIND_ENABLED = @VALGRIND_ENABLED@
+VERSION = @VERSION@
+abs_builddir = @abs_builddir@
+abs_srcdir = @abs_srcdir@
+abs_top_builddir = @abs_top_builddir@
+abs_top_srcdir = @abs_top_srcdir@
+ac_ct_CC = @ac_ct_CC@
+ac_ct_CXX = @ac_ct_CXX@
+am__include = @am__include@
+am__leading_dot = @am__leading_dot@
+am__quote = @am__quote@
+am__tar = @am__tar@
+am__untar = @am__untar@
+bindir = @bindir@
+build_alias = @build_alias@
+builddir = @builddir@
+datadir = @datadir@
+datarootdir = @datarootdir@
+docdir = @docdir@
+dvidir = @dvidir@
+exec_prefix = @exec_prefix@
+host_alias = @host_alias@
+htmldir = @htmldir@
+includedir = @includedir@
+infodir = @infodir@
+install_sh = @install_sh@
+libdir = @libdir@
+libexecdir = @libexecdir@
+localedir = @localedir@
+localstatedir = @localstatedir@
+mandir = @mandir@
+mkdir_p = @mkdir_p@
+oldincludedir = @oldincludedir@
+pdfdir = @pdfdir@
+prefix = @prefix@
+program_transform_name = @program_transform_name@
+psdir = @psdir@
+runstatedir = @runstatedir@
+sbindir = @sbindir@
+sharedstatedir = @sharedstatedir@
+srcdir = @srcdir@
+sysconfdir = @sysconfdir@
+target_alias = @target_alias@
+top_build_prefix = @top_build_prefix@
+top_builddir = @top_builddir@
+top_srcdir = @top_srcdir@
+valgrind_enabled_tools = @valgrind_enabled_tools@
+valgrind_tools = @valgrind_tools@
+AM_CPPFLAGS = \
+	-I$(top_srcdir)/include \
+	-I$(top_srcdir)/test/include \
+	$(CXXFLAGS_UNITTESTS)
+
+test_main_SOURCES = \
+	test_main.cpp \
+	$(top_srcdir)/test/test_global.cpp
+
+all: all-am
+
+.SUFFIXES:
+.SUFFIXES: .cpp .log .o .obj .test .test$(EXEEXT) .trs
+$(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am  $(am__configure_deps)
+	@for dep in $?; do \
+	  case '$(am__configure_deps)' in \
+	    *$$dep*) \
+	      ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \
+	        && { if test -f $@; then exit 0; else break; fi; }; \
+	      exit 1;; \
+	  esac; \
+	done; \
+	echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign test/segment_tree/Makefile'; \
+	$(am__cd) $(top_srcdir) && \
+	  $(AUTOMAKE) --foreign test/segment_tree/Makefile
+Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
+	@case '$?' in \
+	  *config.status*) \
+	    cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \
+	  *) \
+	    echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__maybe_remake_depfiles)'; \
+	    cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__maybe_remake_depfiles);; \
+	esac;
+
+$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
+	cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
+
+$(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps)
+	cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
+$(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps)
+	cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
+$(am__aclocal_m4_deps):
+
+clean-checkPROGRAMS:
+	-test -z "$(check_PROGRAMS)" || rm -f $(check_PROGRAMS)
+$(top_builddir)/test/$(am__dirstamp):
+	@$(MKDIR_P) $(top_builddir)/test
+	@: > $(top_builddir)/test/$(am__dirstamp)
+$(top_builddir)/test/$(DEPDIR)/$(am__dirstamp):
+	@$(MKDIR_P) $(top_builddir)/test/$(DEPDIR)
+	@: > $(top_builddir)/test/$(DEPDIR)/$(am__dirstamp)
+$(top_builddir)/test/test_global.$(OBJEXT):  \
+	$(top_builddir)/test/$(am__dirstamp) \
+	$(top_builddir)/test/$(DEPDIR)/$(am__dirstamp)
+
+test-main$(EXEEXT): $(test_main_OBJECTS) $(test_main_DEPENDENCIES) $(EXTRA_test_main_DEPENDENCIES) 
+	@rm -f test-main$(EXEEXT)
+	$(AM_V_CXXLD)$(CXXLINK) $(test_main_OBJECTS) $(test_main_LDADD) $(LIBS)
+
+mostlyclean-compile:
+	-rm -f *.$(OBJEXT)
+	-rm -f $(top_builddir)/test/*.$(OBJEXT)
+
+distclean-compile:
+	-rm -f *.tab.c
+
+@AMDEP_TRUE@@am__include@ @am__quote@$(top_builddir)/test/$(DEPDIR)/test_global.Po@am__quote@ # am--include-marker
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/test_main.Po@am__quote@ # am--include-marker
+
+$(am__depfiles_remade):
+	@$(MKDIR_P) $(@D)
+	@echo '# dummy' >$@-t && $(am__mv) $@-t $@
+
+am--depfiles: $(am__depfiles_remade)
+
+.cpp.o:
+@am__fastdepCXX_TRUE@	$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.o$$||'`;\
+@am__fastdepCXX_TRUE@	$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\
+@am__fastdepCXX_TRUE@	$(am__mv) $$depbase.Tpo $$depbase.Po
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $<
+
+.cpp.obj:
+@am__fastdepCXX_TRUE@	$(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.obj$$||'`;\
+@am__fastdepCXX_TRUE@	$(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\
+@am__fastdepCXX_TRUE@	$(am__mv) $$depbase.Tpo $$depbase.Po
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	$(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`
+check-valgrind-local: 
+check-valgrind-memcheck-local: 
+check-valgrind-helgrind-local: 
+check-valgrind-drd-local: 
+check-valgrind-sgcheck-local: 
+
+ID: $(am__tagged_files)
+	$(am__define_uniq_tagged_files); mkid -fID $$unique
+tags: tags-am
+TAGS: tags
+
+tags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)
+	set x; \
+	here=`pwd`; \
+	$(am__define_uniq_tagged_files); \
+	shift; \
+	if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \
+	  test -n "$$unique" || unique=$$empty_fix; \
+	  if test $$# -gt 0; then \
+	    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
+	      "$$@" $$unique; \
+	  else \
+	    $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
+	      $$unique; \
+	  fi; \
+	fi
+ctags: ctags-am
+
+CTAGS: ctags
+ctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)
+	$(am__define_uniq_tagged_files); \
+	test -z "$(CTAGS_ARGS)$$unique" \
+	  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \
+	     $$unique
+
+GTAGS:
+	here=`$(am__cd) $(top_builddir) && pwd` \
+	  && $(am__cd) $(top_srcdir) \
+	  && gtags -i $(GTAGS_ARGS) "$$here"
+cscopelist: cscopelist-am
+
+cscopelist-am: $(am__tagged_files)
+	list='$(am__tagged_files)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
+distclean-tags:
+	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
+
+# Recover from deleted '.trs' file; this should ensure that
+# "rm -f foo.log; make foo.trs" re-run 'foo.test', and re-create
+# both 'foo.log' and 'foo.trs'.  Break the recipe in two subshells
+# to avoid problems with "make -n".
+.log.trs:
+	rm -f $< $@
+	$(MAKE) $(AM_MAKEFLAGS) $<
+
+# Leading 'am--fnord' is there to ensure the list of targets does not
+# expand to empty, as could happen e.g. with make check TESTS=''.
+am--fnord $(TEST_LOGS) $(TEST_LOGS:.log=.trs): $(am__force_recheck)
+am--force-recheck:
+	@:
+
+$(TEST_SUITE_LOG): $(TEST_LOGS)
+	@$(am__set_TESTS_bases); \
+	am__f_ok () { test -f "$$1" && test -r "$$1"; }; \
+	redo_bases=`for i in $$bases; do \
+	              am__f_ok $$i.trs && am__f_ok $$i.log || echo $$i; \
+	            done`; \
+	if test -n "$$redo_bases"; then \
+	  redo_logs=`for i in $$redo_bases; do echo $$i.log; done`; \
+	  redo_results=`for i in $$redo_bases; do echo $$i.trs; done`; \
+	  if $(am__make_dryrun); then :; else \
+	    rm -f $$redo_logs && rm -f $$redo_results || exit 1; \
+	  fi; \
+	fi; \
+	if test -n "$$am__remaking_logs"; then \
+	  echo "fatal: making $(TEST_SUITE_LOG): possible infinite" \
+	       "recursion detected" >&2; \
+	elif test -n "$$redo_logs"; then \
+	  am__remaking_logs=yes $(MAKE) $(AM_MAKEFLAGS) $$redo_logs; \
+	fi; \
+	if $(am__make_dryrun); then :; else \
+	  st=0;  \
+	  errmsg="fatal: making $(TEST_SUITE_LOG): failed to create"; \
+	  for i in $$redo_bases; do \
+	    test -f $$i.trs && test -r $$i.trs \
+	      || { echo "$$errmsg $$i.trs" >&2; st=1; }; \
+	    test -f $$i.log && test -r $$i.log \
+	      || { echo "$$errmsg $$i.log" >&2; st=1; }; \
+	  done; \
+	  test $$st -eq 0 || exit 1; \
+	fi
+	@$(am__sh_e_setup); $(am__tty_colors); $(am__set_TESTS_bases); \
+	ws='[ 	]'; \
+	results=`for b in $$bases; do echo $$b.trs; done`; \
+	test -n "$$results" || results=/dev/null; \
+	all=`  grep "^$$ws*:test-result:"           $$results | wc -l`; \
+	pass=` grep "^$$ws*:test-result:$$ws*PASS"  $$results | wc -l`; \
+	fail=` grep "^$$ws*:test-result:$$ws*FAIL"  $$results | wc -l`; \
+	skip=` grep "^$$ws*:test-result:$$ws*SKIP"  $$results | wc -l`; \
+	xfail=`grep "^$$ws*:test-result:$$ws*XFAIL" $$results | wc -l`; \
+	xpass=`grep "^$$ws*:test-result:$$ws*XPASS" $$results | wc -l`; \
+	error=`grep "^$$ws*:test-result:$$ws*ERROR" $$results | wc -l`; \
+	if test `expr $$fail + $$xpass + $$error` -eq 0; then \
+	  success=true; \
+	else \
+	  success=false; \
+	fi; \
+	br='==================='; br=$$br$$br$$br$$br; \
+	result_count () \
+	{ \
+	    if test x"$$1" = x"--maybe-color"; then \
+	      maybe_colorize=yes; \
+	    elif test x"$$1" = x"--no-color"; then \
+	      maybe_colorize=no; \
+	    else \
+	      echo "$@: invalid 'result_count' usage" >&2; exit 4; \
+	    fi; \
+	    shift; \
+	    desc=$$1 count=$$2; \
+	    if test $$maybe_colorize = yes && test $$count -gt 0; then \
+	      color_start=$$3 color_end=$$std; \
+	    else \
+	      color_start= color_end=; \
+	    fi; \
+	    echo "$${color_start}# $$desc $$count$${color_end}"; \
+	}; \
+	create_testsuite_report () \
+	{ \
+	  result_count $$1 "TOTAL:" $$all   "$$brg"; \
+	  result_count $$1 "PASS: " $$pass  "$$grn"; \
+	  result_count $$1 "SKIP: " $$skip  "$$blu"; \
+	  result_count $$1 "XFAIL:" $$xfail "$$lgn"; \
+	  result_count $$1 "FAIL: " $$fail  "$$red"; \
+	  result_count $$1 "XPASS:" $$xpass "$$red"; \
+	  result_count $$1 "ERROR:" $$error "$$mgn"; \
+	}; \
+	{								\
+	  echo "$(PACKAGE_STRING): $(subdir)/$(TEST_SUITE_LOG)" |	\
+	    $(am__rst_title);						\
+	  create_testsuite_report --no-color;				\
+	  echo;								\
+	  echo ".. contents:: :depth: 2";				\
+	  echo;								\
+	  for b in $$bases; do echo $$b; done				\
+	    | $(am__create_global_log);					\
+	} >$(TEST_SUITE_LOG).tmp || exit 1;				\
+	mv $(TEST_SUITE_LOG).tmp $(TEST_SUITE_LOG);			\
+	if $$success; then						\
+	  col="$$grn";							\
+	 else								\
+	  col="$$red";							\
+	  test x"$$VERBOSE" = x || cat $(TEST_SUITE_LOG);		\
+	fi;								\
+	echo "$${col}$$br$${std}"; 					\
+	echo "$${col}Testsuite summary"$(AM_TESTSUITE_SUMMARY_HEADER)"$${std}";	\
+	echo "$${col}$$br$${std}"; 					\
+	create_testsuite_report --maybe-color;				\
+	echo "$$col$$br$$std";						\
+	if $$success; then :; else					\
+	  echo "$${col}See $(subdir)/$(TEST_SUITE_LOG)$${std}";		\
+	  if test -n "$(PACKAGE_BUGREPORT)"; then			\
+	    echo "$${col}Please report to $(PACKAGE_BUGREPORT)$${std}";	\
+	  fi;								\
+	  echo "$$col$$br$$std";					\
+	fi;								\
+	$$success || exit 1
+
+check-TESTS: $(check_PROGRAMS)
+	@list='$(RECHECK_LOGS)';           test -z "$$list" || rm -f $$list
+	@list='$(RECHECK_LOGS:.log=.trs)'; test -z "$$list" || rm -f $$list
+	@test -z "$(TEST_SUITE_LOG)" || rm -f $(TEST_SUITE_LOG)
+	@set +e; $(am__set_TESTS_bases); \
+	log_list=`for i in $$bases; do echo $$i.log; done`; \
+	trs_list=`for i in $$bases; do echo $$i.trs; done`; \
+	log_list=`echo $$log_list`; trs_list=`echo $$trs_list`; \
+	$(MAKE) $(AM_MAKEFLAGS) $(TEST_SUITE_LOG) TEST_LOGS="$$log_list"; \
+	exit $$?;
+recheck: all $(check_PROGRAMS)
+	@test -z "$(TEST_SUITE_LOG)" || rm -f $(TEST_SUITE_LOG)
+	@set +e; $(am__set_TESTS_bases); \
+	bases=`for i in $$bases; do echo $$i; done \
+	         | $(am__list_recheck_tests)` || exit 1; \
+	log_list=`for i in $$bases; do echo $$i.log; done`; \
+	log_list=`echo $$log_list`; \
+	$(MAKE) $(AM_MAKEFLAGS) $(TEST_SUITE_LOG) \
+	        am__force_recheck=am--force-recheck \
+	        TEST_LOGS="$$log_list"; \
+	exit $$?
+test-main.log: test-main$(EXEEXT)
+	@p='test-main$(EXEEXT)'; \
+	b='test-main'; \
+	$(am__check_pre) $(LOG_DRIVER) --test-name "$$f" \
+	--log-file $$b.log --trs-file $$b.trs \
+	$(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \
+	"$$tst" $(AM_TESTS_FD_REDIRECT)
+.test.log:
+	@p='$<'; \
+	$(am__set_b); \
+	$(am__check_pre) $(TEST_LOG_DRIVER) --test-name "$$f" \
+	--log-file $$b.log --trs-file $$b.trs \
+	$(am__common_driver_flags) $(AM_TEST_LOG_DRIVER_FLAGS) $(TEST_LOG_DRIVER_FLAGS) -- $(TEST_LOG_COMPILE) \
+	"$$tst" $(AM_TESTS_FD_REDIRECT)
+@am__EXEEXT_TRUE@.test$(EXEEXT).log:
+@am__EXEEXT_TRUE@	@p='$<'; \
+@am__EXEEXT_TRUE@	$(am__set_b); \
+@am__EXEEXT_TRUE@	$(am__check_pre) $(TEST_LOG_DRIVER) --test-name "$$f" \
+@am__EXEEXT_TRUE@	--log-file $$b.log --trs-file $$b.trs \
+@am__EXEEXT_TRUE@	$(am__common_driver_flags) $(AM_TEST_LOG_DRIVER_FLAGS) $(TEST_LOG_DRIVER_FLAGS) -- $(TEST_LOG_COMPILE) \
+@am__EXEEXT_TRUE@	"$$tst" $(AM_TESTS_FD_REDIRECT)
+distdir: $(BUILT_SOURCES)
+	$(MAKE) $(AM_MAKEFLAGS) distdir-am
+
+distdir-am: $(DISTFILES)
+	@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
+	topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
+	list='$(DISTFILES)'; \
+	  dist_files=`for file in $$list; do echo $$file; done | \
+	  sed -e "s|^$$srcdirstrip/||;t" \
+	      -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
+	case $$dist_files in \
+	  */*) $(MKDIR_P) `echo "$$dist_files" | \
+			   sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
+			   sort -u` ;; \
+	esac; \
+	for file in $$dist_files; do \
+	  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
+	  if test -d $$d/$$file; then \
+	    dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
+	    if test -d "$(distdir)/$$file"; then \
+	      find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
+	    fi; \
+	    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
+	      cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
+	      find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
+	    fi; \
+	    cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
+	  else \
+	    test -f "$(distdir)/$$file" \
+	    || cp -p $$d/$$file "$(distdir)/$$file" \
+	    || exit 1; \
+	  fi; \
+	done
+check-am: all-am
+	$(MAKE) $(AM_MAKEFLAGS) $(check_PROGRAMS)
+	$(MAKE) $(AM_MAKEFLAGS) check-TESTS
+check: check-am
+all-am: Makefile
+installdirs:
+install: install-am
+install-exec: install-exec-am
+install-data: install-data-am
+uninstall: uninstall-am
+
+install-am: all-am
+	@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
+
+installcheck: installcheck-am
+install-strip:
+	if test -z '$(STRIP)'; then \
+	  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
+	    install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
+	      install; \
+	else \
+	  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
+	    install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
+	    "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \
+	fi
+mostlyclean-generic:
+	-test -z "$(TEST_LOGS)" || rm -f $(TEST_LOGS)
+	-test -z "$(TEST_LOGS:.log=.trs)" || rm -f $(TEST_LOGS:.log=.trs)
+	-test -z "$(TEST_SUITE_LOG)" || rm -f $(TEST_SUITE_LOG)
+
+clean-generic:
+
+distclean-generic:
+	-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
+	-test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
+	-test -z "$(top_builddir)/test/$(DEPDIR)/$(am__dirstamp)" || rm -f $(top_builddir)/test/$(DEPDIR)/$(am__dirstamp)
+	-test -z "$(top_builddir)/test/$(am__dirstamp)" || rm -f $(top_builddir)/test/$(am__dirstamp)
+
+maintainer-clean-generic:
+	@echo "This command is intended for maintainers to use"
+	@echo "it deletes files that may require special tools to rebuild."
+check-valgrind: check-valgrind-am
+
+check-valgrind-am: check-valgrind-local
+
+check-valgrind-drd: check-valgrind-drd-am
+
+check-valgrind-drd-am: check-valgrind-drd-local
+
+check-valgrind-helgrind: check-valgrind-helgrind-am
+
+check-valgrind-helgrind-am: check-valgrind-helgrind-local
+
+check-valgrind-memcheck: check-valgrind-memcheck-am
+
+check-valgrind-memcheck-am: check-valgrind-memcheck-local
+
+check-valgrind-sgcheck: check-valgrind-sgcheck-am
+
+check-valgrind-sgcheck-am: check-valgrind-sgcheck-local
+
+clean: clean-am
+
+clean-am: clean-checkPROGRAMS clean-generic mostlyclean-am
+
+distclean: distclean-am
+		-rm -f $(top_builddir)/test/$(DEPDIR)/test_global.Po
+	-rm -f ./$(DEPDIR)/test_main.Po
+	-rm -f Makefile
+distclean-am: clean-am distclean-compile distclean-generic \
+	distclean-tags
+
+dvi: dvi-am
+
+dvi-am:
+
+html: html-am
+
+html-am:
+
+info: info-am
+
+info-am:
+
+install-data-am:
+
+install-dvi: install-dvi-am
+
+install-dvi-am:
+
+install-exec-am:
+
+install-html: install-html-am
+
+install-html-am:
+
+install-info: install-info-am
+
+install-info-am:
+
+install-man:
+
+install-pdf: install-pdf-am
+
+install-pdf-am:
+
+install-ps: install-ps-am
+
+install-ps-am:
+
+installcheck-am:
+
+maintainer-clean: maintainer-clean-am
+		-rm -f $(top_builddir)/test/$(DEPDIR)/test_global.Po
+	-rm -f ./$(DEPDIR)/test_main.Po
+	-rm -f Makefile
+maintainer-clean-am: distclean-am maintainer-clean-generic
+
+mostlyclean: mostlyclean-am
+
+mostlyclean-am: mostlyclean-compile mostlyclean-generic
+
+pdf: pdf-am
+
+pdf-am:
+
+ps: ps-am
+
+ps-am:
+
+uninstall-am:
+
+.MAKE: check-am install-am install-strip
+
+.PHONY: CTAGS GTAGS TAGS all all-am am--depfiles check check-TESTS \
+	check-am check-valgrind-am check-valgrind-drd-am \
+	check-valgrind-drd-local check-valgrind-helgrind-am \
+	check-valgrind-helgrind-local check-valgrind-local \
+	check-valgrind-memcheck-am check-valgrind-memcheck-local \
+	check-valgrind-sgcheck-am check-valgrind-sgcheck-local clean \
+	clean-checkPROGRAMS clean-generic cscopelist-am ctags ctags-am \
+	distclean distclean-compile distclean-generic distclean-tags \
+	distdir dvi dvi-am html html-am info info-am install \
+	install-am install-data install-data-am install-dvi \
+	install-dvi-am install-exec install-exec-am install-html \
+	install-html-am install-info install-info-am install-man \
+	install-pdf install-pdf-am install-ps install-ps-am \
+	install-strip installcheck installcheck-am installdirs \
+	maintainer-clean maintainer-clean-generic mostlyclean \
+	mostlyclean-compile mostlyclean-generic pdf pdf-am ps ps-am \
+	recheck tags tags-am uninstall uninstall-am
+
+.PRECIOUS: Makefile
+
+
+@VALGRIND_CHECK_RULES@
+
+# Tell versions [3.59,3.63) of GNU make to not export all variables.
+# Otherwise a system limit (for SysV at least) may be exceeded.
+.NOEXPORT:
diff --git a/test/segment_tree/test_main.cpp b/test/segment_tree/test_main.cpp
new file mode 100644
index 0000000..c636a22
--- /dev/null
+++ b/test/segment_tree/test_main.cpp
@@ -0,0 +1,1136 @@
+/*************************************************************************
+ *
+ * Copyright (c) 2010, 2011 Kohei Yoshida
+ *
+ * Permission is hereby granted, free of charge, to any person
+ * obtaining a copy of this software and associated documentation
+ * files (the "Software"), to deal in the Software without
+ * restriction, including without limitation the rights to use,
+ * copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following
+ * conditions:
+ *
+ * The above copyright notice and this permission notice shall be
+ * included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+ * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+ * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+ * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+ * OTHER DEALINGS IN THE SOFTWARE.
+ *
+ ************************************************************************/
+
+#include "test_global.hpp" // This must be the first header to be included.
+#include "mdds/segment_tree.hpp"
+
+#include <cstdlib>
+#include <cstdio>
+#include <iostream>
+#include <list>
+#include <memory>
+#include <sstream>
+#include <string>
+#include <vector>
+
+#define ARRAY_SIZE(x) sizeof(x) / sizeof(x[0])
+
+using namespace std;
+using namespace mdds;
+
+template<typename key_type, typename value_type>
+void build_and_dump(segment_tree<key_type, value_type>& db)
+{
+    cout << "build and dump (start) -----------------------------------------" << endl;
+    db.build_tree();
+    db.dump_tree();
+    db.dump_leaf_nodes();
+    cout << "build and dump (end) -------------------------------------------" << endl;
+}
+
+struct test_data
+{
+    string name; // data structure expects the data to have 'name' data member.
+
+    test_data(const string& s) : name(s)
+    {}
+
+    struct ptr_printer
+    {
+        void operator()(const test_data* data) const
+        {
+            cout << data->name << " ";
+        }
+    };
+
+    /**
+     * Use this to sort instances of test_data by name, in ascending order.
+     */
+    struct sort_by_name
+    {
+        bool operator()(const test_data* left, const test_data* right) const
+        {
+            return left->name < right->name;
+        }
+    };
+
+    struct name_printer
+    {
+        void operator()(const test_data* p) const
+        {
+            cout << p->name << " ";
+        }
+    };
+};
+
+template<typename key_type, typename value_type>
+bool check_leaf_nodes(
+    const segment_tree<key_type, value_type>& db, const key_type* keys, value_type* data_chain, size_t key_size)
+{
+    typedef segment_tree<key_type, value_type> st_type;
+    vector<typename st_type::leaf_node_check> checks;
+    checks.reserve(key_size);
+    size_t dcid = 0;
+    for (size_t i = 0; i < key_size; ++i)
+    {
+        typename st_type::leaf_node_check c;
+        c.key = keys[i];
+        value_type p = data_chain[dcid];
+        while (p)
+        {
+            c.data_chain.push_back(p);
+            p = data_chain[++dcid];
+        }
+        checks.push_back(c);
+        ++dcid;
+    }
+
+    return db.verify_leaf_nodes(checks);
+}
+
+template<typename value_type>
+bool check_against_expected(const list<value_type>& test, value_type* expected)
+{
+    size_t i = 0;
+    value_type p = expected[i++];
+    typename list<value_type>::const_iterator itr = test.begin(), itr_end = test.end();
+    while (p)
+    {
+        if (itr == itr_end)
+            // data chain ended prematurely.
+            return false;
+
+        if (*itr != p)
+            // the value is not as expected.
+            return false;
+
+        p = expected[i++];
+        ++itr;
+    }
+    if (itr != itr_end)
+        // data chain is too long.
+        return false;
+
+    return true;
+}
+
+/**
+ * Only check the search result against expected result set.  The caller
+ * needs to run search and pass the result to this function.
+ */
+template<typename key_type, typename value_type>
+bool check_search_result_only(
+    const segment_tree<key_type, value_type>& /*db*/,
+    const typename segment_tree<key_type, value_type>::search_results_type& result, key_type key, value_type* expected)
+{
+    cout << "search key: " << key << " ";
+
+    list<value_type> test;
+    copy(result.begin(), result.end(), back_inserter(test));
+    test.sort(test_data::sort_by_name());
+
+    cout << "search result (sorted): ";
+    for_each(test.begin(), test.end(), test_data::name_printer());
+    cout << endl;
+
+    return check_against_expected(test, expected);
+}
+
+/**
+ * Run the search and check the search result.
+ */
+template<typename key_type, typename value_type>
+bool check_search_result(const segment_tree<key_type, value_type>& db, key_type key, value_type* expected)
+{
+    cout << "search key: " << key << " ";
+
+    typedef typename segment_tree<key_type, value_type>::search_results_type search_result_type;
+    search_result_type data_chain;
+    db.search(key, data_chain);
+    return check_search_result_only(db, data_chain, key, expected);
+}
+
+template<typename key_type, typename value_type>
+bool check_search_result_iterator(const segment_tree<key_type, value_type>& db, key_type key, value_type* expected)
+{
+    cout << "search key: " << key << " ";
+
+    typedef segment_tree<key_type, value_type> db_type;
+    typename db_type::search_results result = db.search(key);
+    list<value_type> test;
+    copy(result.begin(), result.end(), back_inserter(test));
+    test.sort(test_data::sort_by_name());
+
+    cout << "search result (sorted): ";
+    for_each(test.begin(), test.end(), test_data::name_printer());
+    cout << endl;
+
+    return check_against_expected(test, expected);
+}
+
+void st_test_insert_search_removal()
+{
+    stack_printer __stack_printer__("::st_test_insert_segments");
+
+    typedef long key_type;
+    typedef test_data value_type;
+    typedef segment_tree<key_type, value_type*> db_type;
+
+    db_type db;
+    value_type A("A"), B("B"), C("C"), D("D"), E("E"), F("F"), G("G");
+
+    build_and_dump(db);
+    assert(db_type::node::get_instance_count() == 0);
+
+    db.insert(0, 10, &A);
+    build_and_dump(db);
+    {
+        key_type keys[] = {0, 10};
+        value_type* data_chain[] = {&A, 0, 0};
+        assert(check_leaf_nodes(db, keys, data_chain, ARRAY_SIZE(keys)));
+        assert(db_type::node::get_instance_count() == db.leaf_size());
+        assert(db.verify_node_lists());
+    }
+
+    db.insert(0, 5, &B);
+    build_and_dump(db);
+    {
+        key_type keys[] = {0, 5, 10};
+        value_type* data_chain[] = {&A, &B, 0, &A, 0, 0};
+        assert(check_leaf_nodes(db, keys, data_chain, ARRAY_SIZE(keys)));
+        assert(db_type::node::get_instance_count() == db.leaf_size());
+    }
+
+    db.insert(5, 12, &C);
+    build_and_dump(db);
+    {
+        key_type keys[] = {0, 5, 10, 12};
+        value_type* data_chain[] = {&A, &B, 0, &A, &C, 0, &C, 0, 0};
+        assert(check_leaf_nodes(db, keys, data_chain, ARRAY_SIZE(keys)));
+        assert(db_type::node::get_instance_count() == db.leaf_size());
+        assert(db.verify_node_lists());
+    }
+
+    db.insert(10, 24, &D);
+    build_and_dump(db);
+    {
+        key_type keys[] = {0, 5, 10, 12, 24};
+        value_type* data_chain[] = {&A, &B, 0, &A, &C, 0, &C, &D, 0, &D, 0, 0};
+        assert(check_leaf_nodes(db, keys, data_chain, ARRAY_SIZE(keys)));
+        assert(db_type::node::get_instance_count() == db.leaf_size());
+        assert(db.verify_node_lists());
+    }
+
+    db.insert(4, 24, &E);
+    build_and_dump(db);
+    {
+        key_type keys[] = {0, 4, 5, 10, 12, 24};
+        value_type* data_chain[] = {&B, 0, &B, &E, 0, &A, &C, 0, &C, &D, 0, &D, &E, 0, 0};
+        assert(check_leaf_nodes(db, keys, data_chain, ARRAY_SIZE(keys)));
+        assert(db_type::node::get_instance_count() == db.leaf_size());
+        assert(db.verify_node_lists());
+    }
+
+    db.insert(0, 26, &F);
+    build_and_dump(db);
+    {
+        key_type keys[] = {0, 4, 5, 10, 12, 24, 26};
+        value_type* data_chain[] = {&B, 0, &B, &E, 0, &A, &C, 0, &C, &D, 0, &D, &E, &F, 0, &F, 0, 0};
+        assert(check_leaf_nodes(db, keys, data_chain, ARRAY_SIZE(keys)));
+        assert(db_type::node::get_instance_count() == db.leaf_size());
+        assert(db.verify_node_lists());
+    }
+
+    db.insert(12, 26, &G);
+    build_and_dump(db);
+    {
+        key_type keys[] = {0, 4, 5, 10, 12, 24, 26};
+        value_type* data_chain[] = {&B, 0, &B, &E, 0, &A, &C, 0, &C, &D, 0, &D, &E, &F, &G, 0, &F, &G, 0, 0};
+        assert(check_leaf_nodes(db, keys, data_chain, ARRAY_SIZE(keys)));
+        assert(db_type::node::get_instance_count() == db.leaf_size());
+        assert(db.verify_node_lists());
+    }
+
+    // Search tests.  Test boundary cases.
+
+    for (key_type i = -10; i <= 30; ++i)
+    {
+        db_type::search_results_type data_chain;
+        db.search(i, data_chain);
+        cout << "search key " << i << ": ";
+        for_each(data_chain.begin(), data_chain.end(), test_data::ptr_printer());
+        cout << endl;
+    }
+
+    {
+        key_type key = -1;
+        value_type* expected[] = {0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 0;
+        value_type* expected[] = {&A, &B, &F, 0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 4;
+        value_type* expected[] = {&A, &B, &E, &F, 0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 5;
+        value_type* expected[] = {&A, &C, &E, &F, 0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 10;
+        value_type* expected[] = {&C, &D, &E, &F, 0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 12;
+        value_type* expected[] = {&D, &E, &F, &G, 0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 24;
+        value_type* expected[] = {&F, &G, 0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 30;
+        value_type* expected[] = {0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 9999;
+        value_type* expected[] = {0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    // Remove E, F and G and check search results.
+
+    db.remove(&E);
+    db.remove(&F);
+    db.remove(&G);
+    cout << "removed: E F G" << endl;
+    db.dump_tree();
+    db.dump_leaf_nodes();
+
+    for (key_type i = -10; i <= 30; ++i)
+    {
+        db_type::search_results_type data_chain;
+        db.search(i, data_chain);
+        cout << "search key " << i << ": ";
+        for_each(data_chain.begin(), data_chain.end(), test_data::ptr_printer());
+        cout << endl;
+    }
+
+    {
+        key_type key = -1;
+        value_type* expected[] = {0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 0;
+        value_type* expected[] = {&A, &B, 0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 4;
+        value_type* expected[] = {&A, &B, 0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 5;
+        value_type* expected[] = {&A, &C, 0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 10;
+        value_type* expected[] = {&C, &D, 0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 12;
+        value_type* expected[] = {&D, 0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 24;
+        value_type* expected[] = {0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 30;
+        value_type* expected[] = {0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 9999;
+        value_type* expected[] = {0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    // Re-build the tree and check the search results once again, to make sure
+    // we get the same results.
+
+    db.build_tree();
+    db.dump_tree();
+    db.dump_leaf_nodes();
+
+    {
+        key_type key = -1;
+        value_type* expected[] = {0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 0;
+        value_type* expected[] = {&A, &B, 0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 4;
+        value_type* expected[] = {&A, &B, 0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 5;
+        value_type* expected[] = {&A, &C, 0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 10;
+        value_type* expected[] = {&C, &D, 0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 12;
+        value_type* expected[] = {&D, 0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 24;
+        value_type* expected[] = {0};
+        assert(check_search_result(db, key, expected));
+    }
+
+    {
+        key_type key = 30;
+        value_type* expected[] = {0};
+        assert(check_search_result(db, key, expected));
+    }
+}
+
+void st_test_copy_constructor()
+{
+    stack_printer __stack_printer__("::st_test_copy_constructor");
+
+    typedef long key_type;
+    typedef test_data value_type;
+    typedef segment_tree<key_type, value_type*> db_type;
+
+    db_type db;
+    value_type A("A"), B("B"), C("C"), D("D"), E("E"), F("F"), G("G");
+    vector<db_type::segment_data> segments;
+    segments.push_back(db_type::segment_data(0, 10, &A));
+    segments.push_back(db_type::segment_data(0, 5, &B));
+    segments.push_back(db_type::segment_data(5, 12, &C));
+    segments.push_back(db_type::segment_data(10, 24, &D));
+    segments.push_back(db_type::segment_data(4, 24, &E));
+    segments.push_back(db_type::segment_data(0, 26, &F));
+    segments.push_back(db_type::segment_data(12, 26, &G));
+    segments.push_back(db_type::segment_data(0, 0, nullptr)); // null-terminated
+
+    db_type::segment_map_type checks;
+    for (size_t i = 0; segments[i].pdata; ++i)
+    {
+        db.insert(segments[i].begin_key, segments[i].end_key, segments[i].pdata);
+        pair<key_type, key_type> range;
+        range.first = segments[i].begin_key;
+        range.second = segments[i].end_key;
+        checks.insert(db_type::segment_map_type::value_type(segments[i].pdata, range));
+    }
+
+    // Copy before the tree is built.
+
+    db.dump_segment_data();
+    assert(db.verify_segment_data(checks));
+
+    db_type db_copied(db);
+    db_copied.dump_segment_data();
+    assert(db_copied.verify_segment_data(checks));
+    assert(db.is_tree_valid() == db_copied.is_tree_valid());
+    assert(db == db_copied);
+
+    // Copy after the tree is built.
+    db.build_tree();
+    db_type db_copied_tree(db);
+    db_copied_tree.dump_segment_data();
+    db_copied_tree.dump_tree();
+    assert(db_copied_tree.verify_segment_data(checks));
+    assert(db.is_tree_valid() == db_copied_tree.is_tree_valid());
+    assert(db == db_copied_tree);
+}
+
+void st_test_equality()
+{
+    stack_printer __stack_printer__("::st_test_equality");
+
+    typedef uint32_t key_type;
+    typedef test_data value_type;
+    typedef segment_tree<key_type, value_type*> db_type;
+
+    value_type A("A"), B("B"), C("C"), D("D"), E("E"), F("F"), G("G");
+    {
+        db_type db1, db2;
+        db1.insert(0, 10, &A);
+        db2.insert(0, 10, &A);
+        assert(db1 == db2);
+        db2.insert(5, 12, &B);
+        assert(db1 != db2);
+        db1.insert(5, 12, &C);
+        assert(db1 != db2);
+        db1.remove(&C);
+        db2.remove(&B);
+        assert(db1 == db2);
+        db1.insert(4, 20, &D);
+        db2.insert(4, 20, &D);
+        assert(db1 == db2);
+        db1.insert(3, 12, &E);
+        db2.insert(3, 15, &E);
+        assert(db1 != db2);
+    }
+}
+
+void st_test_clear()
+{
+    stack_printer __stack_printer__("::st_test_clear");
+
+    typedef uint8_t key_type;
+    typedef test_data value_type;
+    typedef segment_tree<key_type, value_type*> db_type;
+
+    value_type A("A"), B("B"), C("C"), D("D"), E("E"), F("F"), G("G");
+
+    vector<db_type::segment_data> segments;
+    segments.push_back(db_type::segment_data(0, 10, &A));
+    segments.push_back(db_type::segment_data(0, 5, &B));
+    segments.push_back(db_type::segment_data(5, 12, &C));
+    segments.push_back(db_type::segment_data(10, 24, &D));
+    segments.push_back(db_type::segment_data(4, 24, &E));
+    segments.push_back(db_type::segment_data(0, 26, &F));
+    segments.push_back(db_type::segment_data(12, 26, &G));
+    segments.push_back(db_type::segment_data(0, 0, nullptr)); // null-terminated
+
+    db_type db;
+    for (size_t i = 0; segments[i].pdata; ++i)
+        db.insert(segments[i].begin_key, segments[i].end_key, segments[i].pdata);
+
+    assert(!db.empty());
+    assert(db.size() == 7);
+    cout << "size of db is " << db.size() << endl;
+
+    db.clear();
+    assert(db.empty());
+    assert(db.size() == 0);
+
+    // Insert the same data set once again, but this time build tree afterwards.
+    for (size_t i = 0; segments[i].pdata; ++i)
+        db.insert(segments[i].begin_key, segments[i].end_key, segments[i].pdata);
+
+    db.build_tree();
+    assert(!db.empty());
+    assert(db.size() == 7);
+
+    db.clear();
+    assert(db.empty());
+    assert(db.size() == 0);
+}
+
+void st_test_duplicate_insertion()
+{
+    stack_printer __stack_printer__("::st_test_duplicate_insertion");
+
+    typedef short key_type;
+    typedef test_data value_type;
+    typedef segment_tree<key_type, value_type*> db_type;
+
+    value_type A("A"), B("B"), C("C"), D("D"), E("E"), F("F"), G("G");
+
+    db_type db;
+    assert(db.insert(0, 10, &A));
+    assert(!db.insert(0, 10, &A));
+    assert(!db.insert(2, 30, &A));
+    assert(db.insert(0, 10, &B));
+    db.remove(&A);
+    assert(db.insert(2, 30, &A));
+    build_and_dump(db);
+}
+
+/**
+ * When the number of segments is not a multiple of 2, it creates a tree
+ * where the right side becomes "cut off".  Make sure the search works
+ * correctly under those conditions.
+ */
+void st_test_search_on_uneven_tree()
+{
+    stack_printer __stack_printer__("::st_test_search_on_uneven_tree");
+
+    typedef int16_t key_type;
+    typedef test_data value_type;
+    typedef segment_tree<key_type, value_type*> db_type;
+
+    for (key_type data_count = 10; data_count < 20; ++data_count)
+    {
+        vector<unique_ptr<test_data>> data_store;
+        data_store.reserve(data_count);
+        for (key_type i = 0; i < data_count; ++i)
+        {
+            ostringstream os;
+            os << hex << showbase << i;
+            data_store.emplace_back(new test_data(os.str()));
+        }
+        assert(data_store.size() == static_cast<size_t>(data_count));
+
+        db_type db;
+        for (key_type i = 0; i < data_count; ++i)
+        {
+            test_data* p = data_store[i].get();
+            db.insert(0, i + 1, p);
+        }
+        assert(db.size() == static_cast<size_t>(data_count));
+
+        db.build_tree();
+
+        for (key_type i = -1; i < data_count + 1; ++i)
+        {
+            db_type::search_results_type result;
+            bool success = db.search(i, result);
+            assert(success);
+            cout << "search key: " << i << "  result: ";
+            for_each(result.begin(), result.end(), test_data::name_printer());
+            cout << endl;
+        }
+    }
+}
+
+void st_test_perf_insertion()
+{
+    stack_printer __stack_printer__("::st_test_perf_insertion");
+
+    typedef uint32_t key_type;
+    typedef test_data value_type;
+    typedef segment_tree<key_type, value_type*> db_type;
+
+    key_type data_count = 1000000;
+
+    // First, create test data instances and store them into a vector.
+    vector<unique_ptr<test_data>> data_store;
+    {
+        stack_printer __stack_printer2__("::st_test_perf_insertion:: data array creation");
+        data_store.reserve(data_count);
+        for (key_type i = 0; i < data_count; ++i)
+        {
+            ostringstream os;
+            os << hex << i;
+            data_store.emplace_back(new test_data(os.str()));
+        }
+    }
+    assert(data_store.size() == data_count);
+
+    db_type db;
+    {
+        stack_printer __stack_printer2__("::st_test_perf_insertion:: data array insertion into segment tree");
+        for (key_type i = 0; i < data_count; ++i)
+        {
+            test_data* p = data_store[i].get();
+            db.insert(0, i + 1, p);
+        }
+    }
+    assert(db.size() == data_count);
+
+    {
+        stack_printer __stack_printer2__("::st_test_perf_insertion:: build tree");
+        db.build_tree();
+    }
+    assert(db.is_tree_valid());
+
+    const test_data* test = nullptr;
+    {
+        stack_printer __stack_printer2__("::st_test_perf_insertion:: 200 searches with max results");
+        for (key_type i = 0; i < 200; ++i)
+        {
+            db_type::search_results_type result;
+            db.search(0, result);
+            db_type::search_results_type::const_iterator itr = result.begin(), itr_end = result.end();
+            for (; itr != itr_end; ++itr)
+            {
+                test = *itr;
+                assert(test);
+            }
+        }
+    }
+
+    {
+        stack_printer __stack_printer2__("::st_test_perf_insertion:: 200 searches with max results (iterator)");
+        for (key_type i = 0; i < 200; ++i)
+        {
+            db_type::search_results result = db.search(0);
+            db_type::search_results::iterator itr = result.begin(), itr_end = result.end();
+            for (; itr != itr_end; ++itr)
+            {
+                test = *itr;
+                assert(test);
+            }
+        }
+    }
+
+    {
+        stack_printer __stack_printer2__("::st_test_perf_insertion:: 200 searches with median results");
+        for (key_type i = 0; i < 200; ++i)
+        {
+            db_type::search_results_type result;
+            db.search(data_count / 2, result);
+            db_type::search_results_type::const_iterator itr = result.begin(), itr_end = result.end();
+            for (; itr != itr_end; ++itr)
+            {
+                test = *itr;
+                assert(test);
+            }
+        }
+    }
+
+    {
+        stack_printer __stack_printer2__("::st_test_perf_insertion:: 200 searches with median results (iterator)");
+        for (key_type i = 0; i < 200; ++i)
+        {
+            db_type::search_results result = db.search(data_count / 2);
+            db_type::search_results::iterator itr = result.begin(), itr_end = result.end();
+            for (; itr != itr_end; ++itr)
+            {
+                test = *itr;
+                assert(test);
+            }
+        }
+    }
+
+    {
+        stack_printer __stack_printer2__("::st_test_perf_insertion:: 200 searches with empty results");
+        for (key_type i = 0; i < 200; ++i)
+        {
+            db_type::search_results_type result;
+            db.search(data_count, result);
+            db_type::search_results_type::const_iterator itr = result.begin(), itr_end = result.end();
+            for (; itr != itr_end; ++itr)
+            {
+                test = *itr;
+                assert(test);
+            }
+        }
+    }
+
+    {
+        stack_printer __stack_printer2__("::st_test_perf_insertion:: 200 searches with empty results (iterator)");
+        for (key_type i = 0; i < 200; ++i)
+        {
+            db_type::search_results result = db.search(data_count);
+            db_type::search_results::iterator itr = result.begin(), itr_end = result.end();
+            for (; itr != itr_end; ++itr)
+            {
+                test = *itr;
+                assert(test);
+            }
+        }
+    }
+
+    {
+        stack_printer __stack_printer2__("::st_test_perf_insertion:: 10000 segment removals");
+        for (key_type i = 0; i < 10000; ++i)
+        {
+            test_data* p = data_store[i].get();
+            db.remove(p);
+        }
+    }
+    assert(db.size() == data_count - 10000);
+
+    {
+        stack_printer __stack_printer2__("::st_test_perf_insertion:: clear");
+        db.clear();
+    }
+}
+
+void st_test_aggregated_search_results()
+{
+    stack_printer __stack_printer__("::st_test_aggregated_search_results");
+
+    typedef uint16_t key_type;
+    typedef test_data value_type;
+    typedef segment_tree<key_type, value_type*> db_type;
+
+    value_type A("A"), B("B"), C("C"), D("D"), E("E"), F("F"), G("G");
+
+    vector<db_type::segment_data> segments;
+    segments.push_back(db_type::segment_data(0, 10, &A));
+    segments.push_back(db_type::segment_data(0, 5, &B));
+    segments.push_back(db_type::segment_data(5, 12, &C));
+    segments.push_back(db_type::segment_data(10, 24, &D));
+    segments.push_back(db_type::segment_data(4, 24, &E));
+    segments.push_back(db_type::segment_data(0, 26, &F));
+    segments.push_back(db_type::segment_data(12, 26, &G));
+    segments.push_back(db_type::segment_data(0, 0, nullptr)); // null-terminated
+
+    db_type db;
+    for (size_t i = 0; segments[i].pdata; ++i)
+        db.insert(segments[i].begin_key, segments[i].end_key, segments[i].pdata);
+
+    db.dump_segment_data();
+    db.build_tree();
+
+    db_type::search_results_type result;
+    {
+        key_type key = 0;
+        db.search(key, result);
+        value_type* expected[] = {&A, &B, &F, 0};
+        assert(check_search_result_only(db, result, key, expected));
+    }
+
+    {
+        key_type key = 10;
+        db.search(key, result);
+        // Note the duplicated F's in the search result.
+        value_type* expected[] = {&A, &B, &C, &D, &E, &F, &F, 0};
+        assert(check_search_result_only(db, result, key, expected));
+    }
+
+    {
+        key_type key = 5;
+        db.search(key, result);
+        value_type* expected[] = {&A, &A, &B, &C, &C, &D, &E, &E, &F, &F, &F, 0};
+        assert(check_search_result_only(db, result, key, expected));
+    }
+
+    {
+        result.clear(); // clear the accumulated result set.
+        key_type key = 5;
+        db.search(key, result);
+        value_type* expected[] = {&A, &C, &E, &F, 0};
+        assert(check_search_result_only(db, result, key, expected));
+    }
+}
+
+void st_test_dense_tree_search()
+{
+    stack_printer __stack_printer__("::st_test_dense_tree_search");
+
+    typedef uint16_t key_type;
+    typedef test_data value_type;
+    typedef segment_tree<key_type, value_type*> db_type;
+
+    value_type A("A"), B("B"), C("C"), D("D"), E("E"), F("F"), G("G");
+    db_type db;
+    db.insert(0, 1, &A);
+    db.insert(0, 2, &B);
+    db.insert(0, 3, &C);
+    db.insert(0, 4, &D);
+    db.insert(0, 5, &E);
+    db.insert(0, 6, &F);
+    db.insert(0, 7, &G);
+    db.build_tree();
+    db.dump_tree();
+    db.dump_leaf_nodes();
+
+    {
+        db_type::value_type expected[] = {&A, &B, &C, &D, &E, &F, &G, 0};
+        bool success = check_search_result<key_type, value_type*>(db, 0, expected);
+        assert(success);
+    }
+    {
+        db_type::value_type expected[] = {&B, &C, &D, &E, &F, &G, 0};
+        bool success = check_search_result<key_type, value_type*>(db, 1, expected);
+        assert(success);
+    }
+    {
+        db_type::value_type expected[] = {&C, &D, &E, &F, &G, 0};
+        bool success = check_search_result<key_type, value_type*>(db, 2, expected);
+        assert(success);
+    }
+    {
+        db_type::value_type expected[] = {&D, &E, &F, &G, 0};
+        bool success = check_search_result<key_type, value_type*>(db, 3, expected);
+        assert(success);
+    }
+    {
+        db_type::value_type expected[] = {&E, &F, &G, 0};
+        bool success = check_search_result<key_type, value_type*>(db, 4, expected);
+        assert(success);
+    }
+    {
+        db_type::value_type expected[] = {&F, &G, 0};
+        bool success = check_search_result<key_type, value_type*>(db, 5, expected);
+        assert(success);
+    }
+    {
+        db_type::value_type expected[] = {&G, 0};
+        bool success = check_search_result<key_type, value_type*>(db, 6, expected);
+        assert(success);
+    }
+    {
+        db_type::value_type expected[] = {0};
+        bool success = check_search_result<key_type, value_type*>(db, 7, expected);
+        assert(success);
+    }
+}
+
+void st_test_search_on_empty_set()
+{
+    stack_printer __stack_printer__("::st_test_search_on_empty_set");
+
+    typedef uint16_t key_type;
+    typedef test_data value_type;
+    typedef segment_tree<key_type, value_type*> db_type;
+
+    db_type db;
+    db.build_tree();
+
+    // Search on an empty set should still be considered a success as long as
+    // the tree is built beforehand.
+    db_type::search_results_type result;
+    bool success = db.search(0, result);
+    assert(success);
+    assert(result.empty());
+}
+
+void st_test_search_iterator_basic()
+{
+    stack_printer __stack_printer__("::st_test_search_iterator");
+    typedef uint16_t key_type;
+    typedef test_data value_type;
+    typedef segment_tree<key_type, value_type*> db_type;
+
+    value_type A("A"), B("B"), C("C"), D("D"), E("E"), F("F"), G("G");
+    db_type db;
+    db.insert(0, 1, &A);
+    db.insert(0, 2, &B);
+    db.insert(0, 3, &C);
+    db.insert(0, 4, &D);
+    db.insert(0, 5, &E);
+    db.insert(0, 6, &F);
+    db.insert(0, 7, &G);
+    db.build_tree();
+    db.dump_tree();
+    db.dump_leaf_nodes();
+
+    db_type::search_results result = db.search(0);
+    db_type::search_results::iterator itr;
+    db_type::search_results::iterator itr_beg = result.begin();
+    db_type::search_results::iterator itr_end = result.end();
+    cout << "Iterate through the search results." << endl;
+    for (itr = itr_beg; itr != itr_end; ++itr)
+        cout << (*itr)->name << " ";
+    cout << endl;
+
+    cout << "Do it again." << endl;
+    for (itr = itr_beg; itr != itr_end; ++itr)
+        cout << (*itr)->name << " ";
+    cout << endl;
+
+    cout << "Iterate backwards" << endl;
+    do
+    {
+        --itr;
+        cout << (*itr)->name << " ";
+    } while (itr != itr_beg);
+    cout << endl;
+
+    cout << "Get the last item from the end position." << endl;
+    itr = itr_end;
+    --itr;
+    cout << (*itr)->name << endl;
+
+    cout << "Use for_each to print names." << endl;
+    for_each(itr_beg, itr_end, test_data::ptr_printer());
+    cout << endl;
+}
+
+void st_test_search_iterator_result_check()
+{
+    stack_printer __stack_printer__("::st_test_search_iterator_result_check");
+
+    typedef uint16_t key_type;
+    typedef test_data value_type;
+    typedef segment_tree<key_type, value_type*> db_type;
+
+    value_type A("A"), B("B"), C("C"), D("D"), E("E"), F("F"), G("G");
+    db_type db;
+    db.insert(0, 1, &A);
+    db.insert(0, 2, &B);
+    db.insert(0, 3, &C);
+    db.insert(0, 4, &D);
+    db.insert(0, 5, &E);
+    db.insert(0, 6, &F);
+    db.insert(0, 7, &G);
+    db.build_tree();
+
+    {
+        value_type* expected[] = {&A, &B, &C, &D, &E, &F, &G, 0};
+        bool success = check_search_result_iterator<key_type, value_type*>(db, 0, expected);
+        assert(success);
+    }
+    {
+        value_type* expected[] = {&B, &C, &D, &E, &F, &G, 0};
+        bool success = check_search_result_iterator<key_type, value_type*>(db, 1, expected);
+        assert(success);
+    }
+    {
+        value_type* expected[] = {&C, &D, &E, &F, &G, 0};
+        bool success = check_search_result_iterator<key_type, value_type*>(db, 2, expected);
+        assert(success);
+    }
+    {
+        value_type* expected[] = {&D, &E, &F, &G, 0};
+        bool success = check_search_result_iterator<key_type, value_type*>(db, 3, expected);
+        assert(success);
+    }
+    {
+        value_type* expected[] = {&E, &F, &G, 0};
+        bool success = check_search_result_iterator<key_type, value_type*>(db, 4, expected);
+        assert(success);
+    }
+    {
+        value_type* expected[] = {&F, &G, 0};
+        bool success = check_search_result_iterator<key_type, value_type*>(db, 5, expected);
+        assert(success);
+    }
+    {
+        value_type* expected[] = {&G, 0};
+        bool success = check_search_result_iterator<key_type, value_type*>(db, 6, expected);
+        assert(success);
+    }
+    {
+        value_type* expected[] = {0};
+        bool success = check_search_result_iterator<key_type, value_type*>(db, 7, expected);
+        assert(success);
+    }
+}
+
+/**
+ * When calling search() on empty tree, even without calling build_tree()
+ * should still return a valid search_result instance with a size of 0.
+ */
+void st_test_empty_result_set()
+{
+    stack_printer __stack_printer__("::st_test_empty_result_set");
+    typedef segment_tree<long, string*> db_type;
+    db_type db;
+    db_type::search_results result = db.search(0);
+    cout << "size of empty result set: " << result.size() << endl;
+    assert(result.size() == 0);
+}
+
+void st_test_non_pointer_data()
+{
+    stack_printer __stack_printer__("::st_test_non_pointer_data");
+
+    typedef uint16_t key_type;
+    typedef size_t value_type;
+    typedef segment_tree<key_type, value_type> db_type;
+
+    db_type db;
+    db.insert(0, 1, 10);
+    db.build_tree();
+
+    db_type::search_results result = db.search(0);
+    assert(result.size() == 1);
+    assert(*result.begin() == 10);
+}
+
+int main(int argc, char** argv)
+{
+    try
+    {
+        cmd_options opt;
+        if (!parse_cmd_options(argc, argv, opt))
+            return EXIT_FAILURE;
+
+        if (opt.test_func)
+        {
+            st_test_insert_search_removal();
+            st_test_copy_constructor();
+            st_test_equality();
+            st_test_clear();
+            st_test_duplicate_insertion();
+            st_test_search_on_uneven_tree();
+            st_test_aggregated_search_results();
+            st_test_dense_tree_search();
+            st_test_search_on_empty_set();
+            st_test_search_iterator_basic();
+            st_test_search_iterator_result_check();
+            st_test_empty_result_set();
+            st_test_non_pointer_data();
+        }
+
+        if (opt.test_perf)
+        {
+            st_test_perf_insertion();
+        }
+
+        // At this point, all of the nodes created during the test run should have
+        // been destroyed.  If not, we are leaking memory.
+        typedef segment_tree<uint32_t, void*> db_type;
+        assert(db_type::node::get_instance_count() == 0);
+    }
+    catch (const std::exception& e)
+    {
+        fprintf(stdout, "Test failed: %s\n", e.what());
+        return EXIT_FAILURE;
+    }
+    fprintf(stdout, "Test finished successfully!\n");
+    return EXIT_SUCCESS;
+}